The compressed permuterm index
DOI10.1145/1868237.1868248zbMATH Open1295.68108OpenAlexW2050635028MaRDI QIDQ3188992FDOQ3188992
Authors: Paolo Ferragina, Rossano Venturini 
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1868237.1868248
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)
Information storage and retrieval of data (68P20) Searching and sorting (68P10) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cited In (13)
- Compressed string dictionaries via data-aware subtrie compaction
- Space-efficient substring occurrence estimation
- Compressed string dictionary search with edit distance one
- Lightweight merging of compressed indices based on BWT variants
- Wheeler graphs: a framework for BWT-based data structures
- Lempel-Ziv-78 compressed string dictionaries
- On the complexity of recognizing Wheeler graphs
- Efficient techniques for approximate record matching modulo permutations
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- Indexing permutations for binary strings
- Space efficient merging of de Bruijn graphs and Wheeler graphs
- On optimally partitioning a text to improve its compression
- 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)
