Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
From MaRDI portal
Publication:5136278
DOI10.4230/LIPIcs.ISAAC.2017.57zbMath1457.68075arXiv1707.01743OpenAlexW2963778550MaRDI QIDQ5136278
J. Ian Munro, Yakov Nekrich, Gonzalo Navarro
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1707.01743
Cites Work
- Efficient fully-compressed sequence representations
- Large alphabets and incompressibility
- A framework for space-efficient string kernels
- Suffix trays and suffix trists: structures for faster text indexing
- Compressed suffix trees with full functionality
- Deterministic Dictionaries
- Fully Functional Static and Dynamic Succinct Trees
- Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
- New Lower and Upper Bounds for Representing Sequences
- Alphabet-Dependent String Searching with Wexponential Search Trees
- Compressed representations of sequences and full-text indexes
- Time-Optimal Top-$k$ Document Retrieval
- Alphabet-Independent Compressed Text Indexing
- Suffix Arrays: A New Method for On-Line String Searches
- An analysis of the Burrows—Wheeler transform
- Linear work suffix array construction
- Indexing compressed text
- Rank/select operations on large alphabets
- Fast Prefix Search in Little Space, with Applications
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Deterministic Indexing for Packed Strings
- More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
This page was built for publication: Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
