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

DOI10.1016/J.IPL.2014.08.014MaRDI QIDQ477617zbMATH OpenOpenAlexFDO

Authors Strahil Ristov, Damir Korenčić

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

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

Recommendations

• Linear-time text compression by longest-first substitution
• Linear-time off-line text compression by longest-first substitution.
• Algorithms and Computation
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• A Compressed Enhanced Suffix Array Supporting Fast String Matching
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• A quick tour on suffix arrays and compressed suffix arrays
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• scientific article; zbMATH DE number 2089995

Cites work

• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• A succinct grammar compression
• Algorithms on Strings
• Computing longest previous factor in linear time and applications
• Data compression via textual substitution
• Dynamic extended suffix arrays
• Grammar-based codes: a new class of universal lossless source codes
• Linear-time text compression by longest-first substitution
• On the number of elements to reorder when updating a suffix array
• Permuted Longest-Common-Prefix Array
• Replacing suffix trees with enhanced suffix arrays
• Two Efficient Algorithms for Linear Time Suffix Array Construction

Cited in

(1)

• SOFSEM 2005: Theory and Practice of Computer Science

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477617)