Pages that link to "Item:Q476914"

The following pages link to A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914):

Displaying 8 items.

• 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)
• Shortest Unique Substring Queries on Run-Length Encoded Strings (Q4608632) (← links)
• Tight bounds on the maximum number of shortest unique substrings (Q5110890) (← links)
• Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. (Q5369541) (← links)
• Compact data structures for shortest unique substring queries (Q6536247) (← links)