Practical compressed suffix trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A fully linear-time approximation algorithm for grammar-based compression
- A simple optimal representation for balanced parentheses
- Algorithms on Strings, Trees and Sequences
- An analysis of the Burrows-Wheeler transform
- An(other) Entropy-Bounded Compressed Suffix Tree
- Compressed Text Indexes with Fast Locate
- Compressed representations of sequences and full-text indexes
- Compressed suffix trees with full functionality
- Compressed text indexes, from theory to practice
- Engineering a compressed suffix tree implementation
- Faster entropy-bounded compressed suffix trees
- Fully compressed suffix trees
- Fully-Compressed Suffix Trees
- Fully-functional succinct trees
- New text indexing functionalities of the compressed suffix arrays
- Permuted Longest-Common-Prefix Array
- Practical compact indexes for top-\(k\) document retrieval
- Practical compressed suffix trees
- Practical entropy-compressed rank/select dictionary
- Replacing suffix trees with enhanced suffix arrays
- Self-indexed Text Compression Using Straight-Line Programs
- Self-indexing based on LZ77
- Space efficient suffix trees
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Succinct Trees in Practice
- Suffix Arrays: A New Method for On-Line String Searches
- Wee LCP
Cited in
(17)- Faster repetition-aware compressed suffix trees based on block trees
- Compressed Cache-Oblivious String B-tree
- Counter based suffix tree for DNA pattern repeats
- An(other) Entropy-Bounded Compressed Suffix Tree
- Engineering a compressed suffix tree implementation
- Bidirectional Variable-Order de Bruijn Graphs
- Fully-Compressed Suffix Trees
- The longest common substring problem
- Faster compressed suffix trees for repetitive collections
- Rpair: rescaling RePair with Rsync
- Faster entropy-bounded compressed suffix trees
- Locally compressed suffix arrays
- Lazy Lempel-Ziv factorization algorithms
- Practical compressed suffix trees
- Editorial: Special issue on algorithms for sequence analysis and storage
- Faster repetition-aware compressed suffix trees based on block trees
- Burrows-Wheeler transform and LCP array construction in constant space
This page was built for publication: Practical compressed suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736557)
