Shortest Unique Substring Queries on Run-Length Encoded Strings
From MaRDI portal
Publication:4608632
Recommendations
- Shortest unique palindromic substring queries on run-length encoded strings
- Shortest unique substring query revisited
- Shortest unique substrings queries in optimal time
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
- Shortest unique palindromic substring queries in semi-dynamic settings
- Shortest unique palindromic substring queries in optimal time
- Tight bounds on the maximum number of shortest unique substrings
Cited in
(11)- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Computing minimal unique substrings for a sliding window
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
- Space-efficient algorithms for computing minimal/shortest unique substrings
- Tight bounds on the maximum number of shortest unique substrings
- Compact data structures for shortest unique substring queries
- Range shortest unique substring queries
- Shortest unique palindromic substring queries on run-length encoded strings
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Shortest unique substring query revisited
This page was built for publication: Shortest Unique Substring Queries on Run-Length Encoded Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608632)
