Finding Repeats With Fixed Gap

Roman Kolpakov 1 Grégory 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 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.
Type de document :
Communication dans un congrès
7th International Symposium on String Processing & Information Retrieval - SPIRE 2000, 2000, Coruna, Spain, IEEE Computer Society, pp.162--168, 2000
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

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

Identifiants

  • HAL Id : inria-00107855, version 1

Collections

Citation

Roman Kolpakov, Grégory Kucherov. Finding Repeats With Fixed Gap. 7th International Symposium on String Processing & Information Retrieval - SPIRE 2000, 2000, Coruna, Spain, IEEE Computer Society, pp.162--168, 2000. 〈inria-00107855〉

Partager

Métriques

Consultations de la notice

71

Téléchargements de fichiers

59