Finding approximate tandem repeats in genomic sequences.
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range of definitions of approximate tandem repeats. The ideas and methods underlying the algorithm are described and its effectiveness on genomic data is demonstrated.
Wexler
Ydo
Y
Computer Science Department, Technion, Technion Campus, Haifa, 32000, Israel. ywex@cs.technion.ac.il
Yakhini
Zohar
Z
Kashi
Yechezkel
Y
Geiger
Dan
D
D000465:Algorithms; D019295:Computational Biology / Q000379:methods* / Q000706:statistics & numerical data; D006801:Humans; D008957:Models, Genetic; D015233:Models, Statistical; D017422:Sequence Analysis, DNA / Q000379:methods* / Q000706:statistics & numerical data; D020080:Tandem Repeat Sequences