Pages that link to "Item:Q2938125"
From MaRDI portal
The following pages link to Shortest Unique Substrings Queries in Optimal Time (Q2938125):
Displaying 11 items.
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- Computing minimal unique substrings for a sliding window (Q2118202) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window (Q3297764) (← links)
- Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)
- Compact data structures for shortest unique substring queries (Q6536247) (← links)
- Range shortest unique substring queries (Q6536259) (← links)
