Locally Compressed Suffix Arrays
From MaRDI portal
Publication:2828176
DOI10.1145/2594408zbMath1347.68100OpenAlexW2068589160MaRDI QIDQ2828176
Héctor Ferrada, Rodrigo A. González, Gonzalo Navarro
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2594408
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (3)
Faster repetition-aware compressed suffix trees based on block trees ⋮ Improved and extended locating functionality on compressed suffix arrays ⋮ Fast matching statistics in small space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colored range queries and document retrieval
- String matching with alphabet sampling
- Replacing suffix trees with enhanced suffix arrays
- Wee LCP
- Faster entropy-bounded compressed suffix trees
- Practical compressed suffix trees
- Time-space trade-offs for compressed suffix arrays.
- Compressed suffix trees with full functionality
- Compressed representations of sequences and full-text indexes
- Alphabet-Independent Compressed Text Indexing
- Suffix Arrays: A New Method for On-Line String Searches
- Fully compressed suffix trees
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- An analysis of the Burrows—Wheeler transform
- Compressed Text Indexes with Fast Locate
- Indexing compressed text
- Extended Compact Web Graph Representations
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Fast text searching for regular expressions or automaton searching on tries
- Efficient Storage and Retrieval by Content and Address of Static Files
- Jewels of Stringology
- New text indexing functionalities of the compressed suffix arrays
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Practical Entropy-Compressed Rank/Select Dictionary
- Compressed text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
This page was built for publication: Locally Compressed Suffix Arrays
