Abstract : We propose an algorithm for finding in a word all pairs of occurrences of the same subword within a given distance $r$. The obtained complexity is $O(n\log r +S)$, where $S$ is the size of the output. We also show how the algorithm can be modified in order to find all such pairs of occurrences separated by a given word. The solution uses an algorithm for finding all {\em quasi-squares} in two strings, a problem that generalizes the well-known problem of searching for squares.
https://hal.inria.fr/inria-00107855
Contributeur : Publications Loria
<>
Soumis le : jeudi 19 octobre 2006 - 09:11:59
Dernière modification le : mardi 6 mars 2018 - 17:40:58
Document(s) archivé(s) le : mercredi 29 mars 2017 - 13:06:05
