Practical compressed suffix trees
From MaRDI portal
Publication:1736557
DOI10.3390/a6020319zbMath1461.68060OpenAlexW2059029449MaRDI QIDQ1736557
Gonzalo Navarro, Andrés Abeliuk, Rodrigo Cánovas
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a6020319
Related Items
Bidirectional Variable-Order de Bruijn Graphs ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ The longest common substring problem ⋮ Practical compressed suffix trees ⋮ Editorial: Special issue on algorithms for sequence analysis and storage ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Compressed range minimum queries ⋮ Locally Compressed Suffix Arrays ⋮ Lazy Lempel-Ziv Factorization Algorithms ⋮ Faster Compressed Suffix Trees for Repetitive Collections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple optimal representation for balanced parentheses
- Replacing suffix trees with enhanced suffix arrays
- Wee LCP
- Faster entropy-bounded compressed suffix trees
- Practical compressed suffix trees
- Compressed suffix trees with full functionality
- A fully linear-time approximation algorithm for grammar-based compression
- Space Efficient Suffix Trees
- Compressed representations of sequences and full-text indexes
- Self-indexing Based on LZ77
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Self-indexed Text Compression Using Straight-Line Programs
- Fully compressed suffix trees
- An analysis of the Burrows—Wheeler transform
- Compressed Text Indexes with Fast Locate
- An(other) Entropy-Bounded Compressed Suffix Tree
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Permuted Longest-Common-Prefix Array
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- 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
- Succinct Trees in Practice
- Practical Compact Indexes for Top-kDocument Retrieval
- Compressed text indexes
- Engineering a compressed suffix tree implementation
- Fully-Compressed Suffix Trees
