Random Access to High-Order Entropy Compressed Text
From MaRDI portal
Publication:2848976
DOI10.1007/978-3-642-40273-9_14zbMath1394.68135OpenAlexW158959260MaRDI QIDQ2848976
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_14
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A quick tour on suffix arrays and compressed suffix arrays
- A simple storage scheme for strings achieving entropy bounds
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Robust universal complete codes for transmission and compression
- The cell probe complexity of succinct data structures
- Optimal lower bounds for rank and select indexes
- Fast Compressed Tries through Path Decompositions
- CRAM: Compressed Random Access Memory
- Succinct Representations of Ordinal Trees
- Algorithmics on SLP-compressed strings: A survey
- Changing base without losing space
- Compressed representations of sequences and full-text indexes
- Succinct indexes for strings, binary relations and multilabeled trees
- An analysis of the Burrows—Wheeler transform
- The Smallest Grammar Problem
- Compression, Indexing, and Retrieval for Massive String Data
- Squeezing succinct data structures into entropy bounds
- Simple Random Access Compression
- Compression of individual sequences via variable-rate coding
- A linear lower bound on index size for text retrieval
- Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Random Access to Grammar-Compressed Strings and Trees
- Statistical Encoding of Succinct Data Structures
- Dynamic Compressed Strings with Random Access
