Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
From MaRDI portal
Recommendations
- Time-space trade-offs for longest common extensions
- Time-Space Trade-Offs for Longest Common Extensions
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Longest common extensions in sublinear space
- Faster longest common extension queries in strings over general alphabets
- Low space external memory construction of the succinct permuted longest common prefix array
- Fast linear-space computations of longest common subsequences
- The longest common extension problem revisited and applications to approximate string searching
- Time-space trade-offs for the longest common substring problem
Cites work
- Algorithms on Strings, Trees and Sequences
- Computing all distinct squares in linear time for integer alphabets
- Detecting regularities on grammar-compressed strings
- Deterministic Sparse Suffix Sorting on Rewritable Texts
- Deterministic sub-linear space LCE data structures with efficient construction
- Efficient randomized pattern-matching algorithms
- Efficient string matching with k mismatches
- Engineering parallel string sorting
- Fast string matching with k differences
- Faster algorithms for string matching with k mismatches
- Faster entropy-bounded compressed suffix trees
- Finger search in grammar-compressed strings
- Fully dynamic data structure for LCE queries in compressed space
- scientific article; zbMATH DE number 3984596 (Why is no real title available?)
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- scientific article; zbMATH DE number 1445383 (Why is no real title available?)
- Improved range minimum queries
- In-place sparse suffix sorting
- Incremental String Comparison
- Internal pattern matching queries in a text and applications
- Linear work suffix array construction
- Locally Consistent Parsing for Text Indexing in Small Space
- Longest common extensions in sublinear space
- Longest common extensions with recompression
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- On the sorting-complexity of suffix tree construction
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Preserving order in a forest in less than logarithmic time and linear space
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Sparse suffix tree construction in optimal time and space
- Sparse text indexing in small space
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- The ``runs theorem
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Tight lower bounds for the longest common extension problem
- Time-space trade-offs for longest common extensions
Cited in
(4)
This page was built for publication: Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874509)
