An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
SIAM Journal on Computing
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding Repeats with Fixed Gap
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
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)
Detection of tandem repeats in DNA sequences based on parametric spectral estimation
IEEE Transactions on Information Technology in Biomedicine - Special section on computational intelligence in medical systems
A new method for finding approximate repetitions in DNA sequences
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Classification of Tandem Repeats in the Human Genome
International Journal of Knowledge Discovery in Bioinformatics
Classification of Tandem Repeats in the Human Genome
International Journal of Knowledge Discovery in Bioinformatics
| Hi-index | 0.00 |
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 examined and its effectiveness on genomic data is demonstrated.