Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
From MaRDI portal
Publication:5874509
DOI10.4230/LIPIcs.ESA.2020.39OpenAlexW3082895222MaRDI QIDQ5874509
Patrick Dinklage, Alexander Herlez, Johannes Fischer, Florian Kurpicz, Tomasz Kociumaka
Publication date: 7 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2020.39
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Engineering parallel string sorting
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Faster entropy-bounded compressed suffix trees
- Efficient string matching with k mismatches
- Fast string matching with k differences
- Preserving order in a forest in less than logarithmic time and linear space
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Finger search in grammar-compressed strings
- Fingerprints in compressed strings
- Improved range minimum queries
- Time-space trade-offs for longest common extensions
- Detecting regularities on grammar-compressed strings
- Tight lower bounds for the longest common extension problem
- Deterministic Sparse Suffix Sorting on Rewritable Texts
- Longest Common Extensions in Sublinear Space
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree
- Linear work suffix array construction
- Efficient randomized pattern-matching algorithms
- Algorithms on Strings, Trees and Sequences
- Incremental String Comparison
- Sparse Suffix Tree Construction in Optimal Time and Space
- Fully Dynamic Data Structure for LCE Queries in Compressed Space
- Faster algorithms for string matching with k mismatches
- Sparse Text Indexing in Small Space
- Longest Common Extensions with Recompression.
- Locally Consistent Parsing for Text Indexing in Small Space
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- The “Runs” Theorem
- Internal Pattern Matching Queries in a Text and Applications
- Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction
- On the sorting-complexity of suffix tree construction
This page was built for publication: Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
