Finding approximate repetitions under Hamming distance
Authors:
- Roman KolpakovRKRoman Kolpakov
- Gregory KucherovGKGregory Kucherov
- 1 June 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 303 (1) , 135-156
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An Algorithm for Approximate Tandem RepeatsJournal of Computational Biology, 2001
- A characterization of the squares in a Fibonacci stringTheoretical Computer Science, 1997
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995
- Detecting leftmost maximal periodicitiesDiscrete Applied Mathematics, 1989
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- Detection of periodicities and string-matching in real timeJournal of Mathematical Sciences, 1983
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981