Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:48:41 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:20:57 PM


  • 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⟩



Record views


Files downloads