The following pages link to On maximal repeats in strings (Q1603378):
Displaying 4 items.
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- On Sturmian graphs (Q881581) (← links)
- On-line construction of compact suffix vectors and maximal repeats (Q955004) (← links)
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity (Q1748195) (← links)
