Compact directed acyclic word graphs for a sliding window
From MaRDI portal
Publication:876704
DOI10.1016/S1570-8667(03)00064-9zbMath1118.68755WikidataQ90345535 ScholiaQ90345535MaRDI QIDQ876704
Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
sliding window; linear-time algorithm; author keywords: on-line text compression; compact directed acyclic word graphs
68W05: Nonnumerical algorithms
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68P05: Data structures
Related Items
On the Structure of Consistent Partitions of Substring Set of a Word, On-line suffix tree construction with reduced branching, On-line construction of compact directed acyclic word graphs, WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING
Cites Work