Substring compression problems

MaRDI QIDQ2921685zbMATH OpenFDO

Authors Graham Cormode, S. Muthukrishnan

Publication date 13 October 2014

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25) Algorithms on strings (68W32)

Recommendations

• Generalized substring compression
• Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
• String matching in Lempel-Ziv compressed strings
• Towards approximate matching in compressed strings: local subsequence recognition
• scientific article; zbMATH DE number 1263249

Cited in

(19)

• Sublinear algorithms for approximating string compressibility
• Generalized substring compression
• Adaptive learning of compressible strings
• Sensitivity of string compressors and repetitiveness measures
• Orthogonal range searching for text indexing
• Finding characteristic substrings from compressed texts
• Computing minimal and maximal suffixes of a substring
• Substring Range Reporting
• Avoiding substrings in compositons
• Window Subsequence Problems for Compressed Texts
• Sublinear Algorithms for Approximating String Compressibility
• On Optimally Partitioning a Text to Improve Its Compression
• Bicriteria data compression
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• Range LCP
• Substring complexities on run-length compressed strings
• Internal pattern matching queries in a text and applications
• Maintaining the size of LZ77 on semi-dynamic strings
• LZ78 substring compression in compressed space

This page was built for publication: Substring compression problems

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