Using static suffix array in dynamic application: case of text compression by longest first substitution

DOI10.1016/j.ipl.2014.08.014zbMath1302.68104OpenAlexW1963887925MaRDI 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

zbMATH Keywords

algorithmsenhanced suffix arraygrammar text compressionlongest first substitutiontext index update

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

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

This page was built for publication: Using static suffix array in dynamic application: case of text compression by longest first substitution