Computing minimal unique substrings for a sliding window
From MaRDI portal
Recommendations
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Space-efficient algorithms for computing minimal/shortest unique substrings
- Minimum unique substrings and maximum repeats
- Shortest unique substring query revisited
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
Cites work
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
- A universal algorithm for sequential data compression
- Absent words in a sliding window with applications
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Minimum unique substrings and maximum repeats
- On-line construction of suffix trees
- Shortest Unique Substring Queries on Run-Length Encoded Strings
- Shortest unique substrings queries in optimal time
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- String processing and information retrieval. 21st international symposium, SPIRE 2014, Ouro Preto, Brazil, October 20--22, 2014. Proceedings
- Words and forbidden factors
Cited in
(6)- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Shortest unique palindromic substring queries in semi-dynamic settings
- Minimizers in semi-dynamic strings
- Maintaining the size of LZ77 on semi-dynamic strings
- Minimum unique substrings and maximum repeats
- Data structures for computing unique palindromes in static and non-static strings
This page was built for publication: Computing minimal unique substrings for a sliding window
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118202)
