Iterated straight-line programs
From MaRDI portal
Publication:6547917
DOI10.1007/978-3-031-55598-5_5MaRDI QIDQ6547917
Gonzalo Navarro, Cristian Urbina
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- On compressing and indexing repetitive sequences
- Novel results on the number of runs of the Burrows-Wheeler-transform
- A separation of \(\gamma\) and \(b\) via Thue-Morse words
- On stricter reachable repetitiveness measures
- Sublinear algorithms for approximating string compressibility
- Sensitivity of string compressors and repetitiveness measures
- The Smallest Grammar Problem
- Data compression via textual substitution
- On the Complexity of Finite Sequences
- On the Approximation Ratio of Ordered Parsings
- Optimal-Time Dictionary-Compressed Indexes
- Balancing Straight-line Programs
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- At the roots of dictionary compression: string attractors
- Random Access to Grammar-Compressed Strings and Trees
- Bit catastrophes for the Burrows-Wheeler transform
- Balancing run-length straight-line programs
- Toward a Definitive Compressibility Measure for Repetitive Sequences
- An upper bound and linear-space queries on the LZ-End parsing
This page was built for publication: Iterated straight-line programs
