Range shortest unique substring queries
From MaRDI portal
Publication:6536259
Recommendations
Cites work
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- A linear space data structure for range LCP queries
- A linear-space data structure for range-LCP queries in poly-logarithmic time
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Fast Algorithms for Finding Nearest Common Ancestors
- Maximal motif discovery in a sliding window
- Orthogonal point location and rectangle stabbing queries in 3-d
- Range LCP
- Recursive Star-Tree Parallel Data Structure
- Shortest Unique Substring Queries on Run-Length Encoded Strings
- Shortest unique palindromic substring queries on run-length encoded strings
- Shortest unique substring query revisited
- Shortest unique substrings queries in optimal time
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Space-time trade-offs for the shortest unique substring problem
This page was built for publication: Range shortest unique substring queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536259)