Pages that link to "Item:Q2207510"
From MaRDI portal
The following pages link to Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510):
Displaying 7 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)
- Computing minimal unique substrings for a sliding window (Q2118202) (← 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)
- (Q4207596) (← links)
- Tight bounds on the maximum number of shortest unique substrings (Q5110890) (← links)