On Sensitivity of Compact Directed Acyclic Word Graphs

DOI10.1007/978-3-031-33180-0_13arXiv2303.01726OpenAlexW4381304394MaRDI QIDQ6134872

Shunsuke Inenaga, Unnamed Author, Yuto Nakashima

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.01726

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

On Sensitivity of Compact Directed Acyclic Word Graphs

Cites Work

• On the structure of compacted subword graphs of Thue-Morse words and their applications
• On-line construction of compact directed acyclic word graphs
• Towards a definitive measure of repetitiveness
• Sensitivity of string compressors and repetitiveness measures
• Composite Repetition-Aware Data Structures
• A universal algorithm for sequential data compression
• Fast Label Extraction in the CDAWG
• Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
• Complete inverted files for efficient text retrieval and analysis
• At the roots of dictionary compression: string attractors
• On Sensitivity of Compact Directed Acyclic Word Graphs