Abstract
The problem of computing tandem repetitions with K possible mismatches is studied. Two main definitions are considered, and for both of them an O(nK logK + S) algorithm is proposed (S the size of the output). This improves, in particular, the bound obtained in [17].
Cite
CITATION STYLE
APA
Kolpakov, R., & Kucherov, G. (2001). Finding approximate repetitions under hamming distance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2161, pp. 170–181). Springer Verlag. https://doi.org/10.1007/3-540-44676-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free