Finding Repeats With Fixed Gap

Roman Kolpakov Gregory Kucherov 1
1 POLKA - Polynomials, Combinatorics, Arithmetic
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose an algorithm for finding in a word all pairs of occurrences of the same subword with a given distance r between them. 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 quasi-squares in two strings, a problem that generalizes the known problem of searching for squares.
Type de document :
[Research Report] RR-3901, INRIA. 2000, pp.15
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:48:41
Dernière modification le : mardi 6 mars 2018 - 17:40:58
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:20:57



  • HAL Id : inria-00072753, version 1



Roman Kolpakov, Gregory Kucherov. Finding Repeats With Fixed Gap. [Research Report] RR-3901, INRIA. 2000, pp.15. 〈inria-00072753〉



Consultations de la notice


Téléchargements de fichiers