A Self-index on Block Trees
From MaRDI portal
Publication:5150940
DOI10.1007/978-3-319-67428-5_24zbMath1454.68039arXiv1606.06617OpenAlexW2963210383MaRDI QIDQ5150940
Publication date: 16 February 2021
Published in: String Processing and Information Retrieval (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.06617
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20) Computing methodologies for text processing; mathematical typography (68U15)
Related Items (3)
Block trees ⋮ Universal compressed text indexing ⋮ A compressed dynamic self-index for highly repetitive text collections
Uses Software
Cites Work
- Unnamed Item
- On compressing and indexing repetitive sequences
- Succinct representations of permutations and functions
- Approximation of grammar-based compression via recompression
- A \textit{really} simple approximation of smallest grammar
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Dynamic index and LZ factorization in compressed space
- Wavelet trees for all
- A fully linear-time approximation algorithm for grammar-based compression
- A Faster Grammar-Based Self-index
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Self-Indexed Grammar-Based Compression
- On the Redundancy of Succinct Data Structures
- The Smallest Grammar Problem
- A universal algorithm for sequential data compression
- Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing
- Practical Entropy-Compressed Rank/Select Dictionary
- Orthogonal range searching on the RAM, revisited
- LZ77-Based Self-indexing with Faster Pattern Matching
This page was built for publication: A Self-index on Block Trees
