Finding Repeats With Fixed Gap - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

Finding Repeats With Fixed Gap

Roman Kolpakov
  • Function : Author


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3901.pdf (231.86 Ko) Télécharger le fichier

Dates and versions

inria-00072753 , version 1 (24-05-2006)


  • 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⟩
92 View
184 Download


Gmail Facebook Twitter LinkedIn More