On stricter reachable repetitiveness measures

DOI10.1007/978-3-030-86692-1_16MaRDI QIDQ2146140zbMATH OpenOpenAlexFDO

Authors Gonzalo Navarro, Cristian Urbina

Publication date 15 June 2022

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

zbMATH Keywords

combinatorics on wordsdata compressionrepetitiveness measures

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• At the roots of dictionary compression: string attractors
• Automatic Sequences
• Collage system: A unifying framework for compressed pattern matching.
• Data compression via textual substitution
• Efficient algorithms for Lempel-Ziv encoding
• Grammar-Based Tree Compression
• Grammar-based codes: a new class of universal lossless source codes
• On the Approximation Ratio of Ordered Parsings
• On the Complexity of Finite Sequences
• Optimal-Time Dictionary-Compressed Indexes
• Standard Sturmian morphisms
• Sublinear algorithms for approximating string compressibility
• Towards a definitive measure of repetitiveness

Cited in

(3)

• Logarithmic equal-letter runs for BWT of purely morphic words
• Sensitivity of string compressors and repetitiveness measures
• Iterated straight-line programs

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

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