On stricter reachable repetitiveness measures

DOI10.1007/978-3-030-86692-1_16OpenAlexW3202806638MaRDI QIDQ2146140

Cristian Urbina, Gonzalo Navarro

Publication date: 15 June 2022

Full work available at URL: https://arxiv.org/abs/2105.13595

zbMATH Keywords

data compressioncombinatorics on wordsrepetitiveness measures

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (2)

Logarithmic equal-letter runs for BWT of purely morphic words ⋮ Sensitivity of string compressors and repetitiveness measures

Cites Work

• Unnamed Item
• Standard Sturmian morphisms
• Collage system: A unifying framework for compressed pattern matching.
• Towards a definitive measure of repetitiveness
• Sublinear algorithms for approximating string compressibility
• Grammar-Based Tree Compression
• Data compression via textual substitution
• On the Complexity of Finite Sequences
• Automatic Sequences
• Grammar-based codes: a new class of universal lossless source codes
• On the Approximation Ratio of Ordered Parsings
• Optimal-Time Dictionary-Compressed Indexes
• Efficient algorithms for Lempel-Ziv encoding
• At the roots of dictionary compression: string attractors

This page was built for publication: On stricter reachable repetitiveness measures