String Processing and Information Retrieval, International Symposium on (2000)
A Coru?a, Spain
Sept. 27, 2000 to Sept. 29, 2000
G. Kucherov , Inst. for Inf. & Appl. Math., Moscow Univ., Russia
R. Kolpakov , Inst. for Inf. & Appl. Math., Moscow Univ., Russia
We propose an algorithm for finding, within 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 quasi-squares in two strings, a problem that generalizes the well-known problem of searching for squares.
string matching; subword occurrence repeats; fixed gap; complexity; output size; occurrence pairs; quasi-squares; strings; searching
G. Kucherov, R. Kolpakov, "Finding Repeats with Fixed Gap", String Processing and Information Retrieval, International Symposium on, vol. 00, no. , pp. 162, 2000, doi:10.1109/SPIRE.2000.878192