Using static suffix array in dynamic application: case of text compression by longest first substitution
From MaRDI portal
Publication:477617
DOI10.1016/j.ipl.2014.08.014zbMath1302.68104MaRDI QIDQ477617
Damir Korenčić, Strahil Ristov
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.08.014
algorithms; enhanced suffix array; grammar text compression; longest first substitution; text index update
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68P05: Data structures
Cites Work
- Unnamed Item
- On the number of elements to reorder when updating a suffix array
- Replacing suffix trees with enhanced suffix arrays
- Computing longest previous factor in linear time and applications
- Dynamic extended suffix arrays
- Linear-time text compression by longest-first substitution
- Permuted Longest-Common-Prefix Array
- Data compression via textual substitution
- Grammar-based codes: a new class of universal lossless source codes
- A Succinct Grammar Compression
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Algorithms on Strings