Space-efficient conversions from SLPs
From MaRDI portal
Publication:6547925
DOI10.1007/978-3-031-55598-5_10MaRDI QIDQ6547925
Artur Jeż, Travis Gagie, Adrián Goga, Gonzalo Navarro
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Universal compressed text indexing
- Dynamic index and LZ factorization in compressed space
- Fingerprints in compressed strings
- Wavelet trees for all
- Grammar-compressed indexes with logarithmic search time
- Faster Fully Compressed Pattern Matching by Recompression
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
- Linear work suffix array construction
- The Smallest Grammar Problem
- Fast Prefix Search in Little Space, with Applications
- Efficient randomized pattern-matching algorithms
- On the Complexity of Finite Sequences
- Grammar-based codes: a new class of universal lossless source codes
- Range Predecessor and Lempel-Ziv Parsing
- Sparse Suffix Tree Construction in Optimal Time and Space
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- On the Approximation Ratio of Ordered Parsings
- Optimal-Time Dictionary-Compressed Indexes
- Balancing Straight-line Programs
- From LZ77 to the run-length encoded burrows-wheeler transform, and back
- Longest Common Extensions with Recompression.
- 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
- Toward a Definitive Compressibility Measure for Repetitive Sequences
- Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
This page was built for publication: Space-efficient conversions from SLPs
