Pages that link to "Item:Q990128"
From MaRDI portal
The following pages link to Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128):
Displaying 7 items.
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- A fast algorithm for the all-pairs suffix-prefix problem (Q1676303) (← links)
- A simple algorithm for computing the document array (Q2011038) (← links)
- All-pairs suffix/prefix in optimal time using Aho-Corasick space (Q2169425) (← links)
- An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
- (Q5090335) (← links)
