Pages that link to "Item:Q626893"
From MaRDI portal
The following pages link to Fast, practical algorithms for computing all the repeats in a string (Q626893):
Displaying 6 items.
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- String covering with optimal covers (Q1757464) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
