Finding Repeats With Fixed Gap (2000)
| Venue: | IN: PROC. OF THE 7TH INT’L SYMP. ON STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE). WASHINGTON: IEEE COMPUTER SOCIETY |
| Citations: | 4 - 2 self |
BibTeX
@INPROCEEDINGS{Kolpakov00findingrepeats,
author = {Roman Kolpakov and Gregory Kucherov},
title = {Finding Repeats With Fixed Gap},
booktitle = {IN: PROC. OF THE 7TH INT’L SYMP. ON STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE). WASHINGTON: IEEE COMPUTER SOCIETY},
year = {2000},
pages = {162--168},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
