Faster Compressed Suffix Trees for Repetitive Collections
From MaRDI portal
Publication:5266617
DOI10.1145/2851495zbMath1365.68184OpenAlexW2299901589MaRDI QIDQ5266617
Alberto Ordóñez Pereira, Gonzalo Navarro
Publication date: 16 June 2017
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/147677
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (6)
Faster repetition-aware compressed suffix trees based on block trees ⋮ FM-index of alignment with gaps ⋮ Block trees ⋮ Unnamed Item ⋮ Faster Compressed Suffix Trees for Repetitive Collections ⋮ Online LZ77 Parsing and Matching Statistics with RLBWTs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On compressing and indexing repetitive sequences
- Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
- Replacing suffix trees with enhanced suffix arrays
- Wee LCP
- Faster entropy-bounded compressed suffix trees
- Practical compressed suffix trees
- On-line construction of suffix trees
- Engineering a lightweight external memory suffix array construction algorithm
- Grammar compressed sequences with rank/select support
- Lightweight data indexing and compression in external memory
- Compressed suffix trees with full functionality
- A fully linear-time approximation algorithm for grammar-based compression
- Fully Functional Static and Dynamic Succinct Trees
- Suffix Tree of Alignment: An Efficient Index for Similar Data
- Indexing Highly Repetitive Collections
- A Faster Grammar-Based Self-index
- Fast Relative Lempel-Ziv Self-index for Similar Sequences
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- The string B-tree
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
- Fully compressed suffix trees
- An analysis of the Burrows—Wheeler transform
- Self-Indexed Grammar-Based Compression
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- A Succinct Grammar Compression
- Succinct Trees in Practice
- LCP Array Construction in External Memory
- Faster Compressed Suffix Trees for Repetitive Collections
- Better external memory suffix array construction
- Foundations of Software Science and Computation Structures
- A theoretical and experimental study on the construction of suffix arrays in external memory
This page was built for publication: Faster Compressed Suffix Trees for Repetitive Collections
