Finding Approximate Repetitions under Hamming Distance

Authors:
Roman M. Kolpakov;Gregory Kucherov
Affiliations:
-;-
Venue:
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Year:
2001

Citing 12
Cited 2

An O(n log n) algorithm for finding all repetitions in a string

Journal of Algorithms
Detecting leftmost maximal periodicities

Discrete Applied Mathematics - Combinatorics and complexity
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
An algorithm for finding tandem repeats of unspecified pattern size

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Identifying satellites in nucleic acid sequences

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Approximate string matching: a simpler faster algorithm

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Linear Algorithm for Data Compression via String Matching

Journal of the ACM (JACM)
An Algorithm for Approximate Tandem Repeats

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Computation of Squares in a String (Preliminary Version)

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
On Maximal Repetitions in Words

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A first step toward chromosome analysis by compression algorithms

INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)

Removing artifacts of approximated motifs

ITBAM'11 Proceedings of the Second international conference on Information technology in bio- and medical informatics
E-Coli promoter recognition using neural networks with feature selection

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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 log K + S) algorithm is proposed (S the size of the output). This improves, in particular, the bound obtained in [17].