The compressed permuterm index
From MaRDI portal
Publication:3188992
Recommendations
- Faster compressed dictionary matching
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Indexing compressed text
- Compressed indexes for dynamic text collections
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
Cited in
(14)- On optimally partitioning a text to improve its compression
- Compressed string dictionary search with edit distance one
- Space efficient merging of de Bruijn graphs and Wheeler graphs
- Engineering a textbook approach to index massive string dictionaries
- Indexing permutations for binary strings
- Compressed string dictionaries via data-aware subtrie compaction
- Wheeler graphs: a framework for BWT-based data structures
- Lempel-Ziv-78 compressed string dictionaries
- Efficient techniques for approximate record matching modulo permutations
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- Lightweight merging of compressed indices based on BWT variants
- Space-efficient substring occurrence estimation
- On the complexity of recognizing Wheeler graphs
- A new class of string transformations for compressed text indexing
This page was built for publication: The compressed permuterm index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188992)