| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Finding Repeats With Fixed Gap
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.
Cited literature [25 references]
https://hal.inria.fr/inria-00107855
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, October 19, 2006 - 9:11:59 AM
Last modification on : Friday, February 4, 2022 - 3:31:53 AM
Long-term archiving on: : Wednesday, March 29, 2017 - 1:06:05 PM
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, October 19, 2006 - 9:11:59 AM
Last modification on : Friday, February 4, 2022 - 3:31:53 AM
Long-term archiving on: : Wednesday, March 29, 2017 - 1:06:05 PM