Faster compressed suffix trees for repetitive collections
DOI10.1145/2851495zbMATH Open1365.68184OpenAlexW2299901589MaRDI QIDQ5266617FDOQ5266617
Authors: 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
Recommendations
Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Algorithms on Strings, Trees and Sequences
- A fully linear-time approximation algorithm for grammar-based compression
- Fully functional static and dynamic succinct trees
- Compressed representations of sequences and full-text indexes
- The string B-tree
- An analysis of the Burrows-Wheeler transform
- Title not available (Why is that?)
- Succinct Trees in Practice
- Compressed suffix trees with full functionality
- Fully compressed suffix trees
- Random access to grammar-compressed strings
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- On-line construction of suffix trees
- Suffix tree of alignment: an efficient index for similar data
- Indexing highly repetitive collections
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- On compressing and indexing repetitive sequences
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Self-indexed grammar-based compression
- Faster entropy-bounded compressed suffix trees
- Title not available (Why is that?)
- Replacing suffix trees with enhanced suffix arrays
- Lightweight data indexing and compression in external memory
- Wee LCP
- A succinct grammar compression
- Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
- Practical compressed suffix trees
- LCP array construction in external memory
- Foundations of Software Science and Computation Structures
- Better external memory suffix array construction
- A faster grammar-based self-index
- A theoretical and experimental study on the construction of suffix arrays in external memory
- Title not available (Why is that?)
- Faster compressed suffix trees for repetitive collections
- Engineering a lightweight external memory suffix array construction algorithm
- Grammar compressed sequences with rank/select support
- Fast relative Lempel-Ziv self-index for similar sequences
Cited In (10)
- Block trees
- Practical compressed suffix trees
- Title not available (Why is that?)
- Grammar compressed sequences with rank/select support
- Faster repetition-aware compressed suffix trees based on block trees
- Online LZ77 parsing and matching statistics with RLBWTs
- Composite repetition-aware data structures
- Faster repetition-aware compressed suffix trees based on block trees
- FM-index of alignment with gaps
- Faster compressed suffix trees for repetitive collections
Uses Software
This page was built for publication: Faster compressed suffix trees for repetitive collections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266617)
