Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
From MaRDI portal
Publication:6545409
DOI10.1007/978-3-031-43980-3_3MaRDI QIDQ6545409
Mizuki Sue, Yuto Nakashima, Yasuaki Kobayashi, Hiroki Arimura, Shunsuke Inenaga
Publication date: 29 May 2024
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- On the structure of compacted subword graphs of Thue-Morse words and their applications
- Computing longest previous factor in linear time and applications
- Measuring the clustering effect of BWT via RLE
- Burrows-Wheeler transform of words defined by morphisms
- Composite Repetition-Aware Data Structures
- Permuted Longest-Common-Prefix Array
- Algorithms on Strings, Trees and Sequences
- Converting SLP to LZ78 in almost Linear Time
- On the Approximation Ratio of Ordered Parsings
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
- Complete inverted files for efficient text retrieval and analysis
Related Items (1)
This page was built for publication: Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
