Faster compressed suffix trees for repetitive collections
From MaRDI portal
Publication:5266617
Recommendations
Cites work
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 1984684 (Why is no real title available?)
- scientific article; zbMATH DE number 2038722 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A faster grammar-based self-index
- A fully linear-time approximation algorithm for grammar-based compression
- A succinct grammar compression
- A theoretical and experimental study on the construction of suffix arrays in external memory
- Algorithms on Strings, Trees and Sequences
- An analysis of the Burrows-Wheeler transform
- Better external memory suffix array construction
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Compressed representations of sequences and full-text indexes
- Compressed suffix trees with full functionality
- Engineering a lightweight external memory suffix array construction algorithm
- Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
- Fast relative Lempel-Ziv self-index for similar sequences
- Faster compressed suffix trees for repetitive collections
- Faster entropy-bounded compressed suffix trees
- Foundations of Software Science and Computation Structures
- Fully compressed suffix trees
- Fully functional static and dynamic succinct trees
- Grammar compressed sequences with rank/select support
- Indexing highly repetitive collections
- LCP array construction in external memory
- Lightweight data indexing and compression in external memory
- On compressing and indexing repetitive sequences
- On-line construction of suffix trees
- Practical compressed suffix trees
- Random access to grammar-compressed strings
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Replacing suffix trees with enhanced suffix arrays
- Self-indexed grammar-based compression
- Succinct Trees in Practice
- Suffix Arrays: A New Method for On-Line String Searches
- Suffix tree of alignment: an efficient index for similar data
- The string B-tree
- Wee LCP
Cited in
(10)- Block trees
- Practical compressed suffix trees
- scientific article; zbMATH DE number 7559194 (Why is no real title available?)
- 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
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)
