Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
From MaRDI portal
Publication:5150942
DOI10.1007/978-3-319-67428-5_26zbMath1454.68040arXiv1705.09779OpenAlexW2617847233MaRDI QIDQ5150942
Shunsuke Inenaga, Keisuke Goto, Takuya Takagi, Hiroki Arimura, Yuta Fujishige
Publication date: 16 February 2021
Published in: String Processing and Information Retrieval (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.09779
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
On Sensitivity of Compact Directed Acyclic Word Graphs, Online algorithms for constructing linear-size suffix trie, Top tree compression of tries
Cites Work
- Linear-size suffix tries
- On compressing and indexing repetitive sequences
- On maximal repeats in strings
- Composite Repetition-Aware Data Structures
- Compressed representations of sequences and full-text indexes
- Self-Indexed Grammar-Based Compression
- Efficient Computation of Substring Equivalence Classes with Suffix Arrays
- Jewels of Stringology
- Random Access to Grammar-Compressed Strings and Trees
- Unnamed Item
- Unnamed Item
