On stricter reachable repetitiveness measures

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

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

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

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)