Repetitiveness measures based on string morphisms
From MaRDI portal
Cites work
- A separation of \(\gamma\) and \(b\) via Thue-Morse words
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Approximation of grammar-based compression via recompression
- At the roots of dictionary compression: string attractors
- Automatic Sequences
- Balancing Straight-line Programs
- Collage system: A unifying framework for compressed pattern matching.
- Data compression via textual substitution
- Data structure lower bounds on random access to grammar-compressed strings
- Efficient algorithms for Lempel-Ziv encoding
- Fully dynamic data structure for LCE queries in compressed space
- scientific article; zbMATH DE number 3911740 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 1305471 (Why is no real title available?)
- scientific article; zbMATH DE number 3421926 (Why is no real title available?)
- Iterated straight-line programs
- L-systems for measuring repetitiveness
- Near-optimal search time in -optimal space, and vice versa
- Novel results on the number of runs of the Burrows-Wheeler-transform
- On stricter reachable repetitiveness measures
- On the Approximation Ratio of Ordered Parsings
- On the complexity of computing determinants
- On the Complexity of Finite Sequences
- Random access to grammar-compressed strings and trees
- Subword complexities of various classes of deterministic developmental languages without interactions
- Succinct representations of permutations and functions
- The Smallest Grammar Problem
- Toward a Definitive Compressibility Measure for Repetitive Sequences
This page was built for publication: Repetitiveness measures based on string morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985823)
