Finding Approximate Tandem Repeats in Genomic Sequences
- 1 September 2005
- journal article
- review article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 12 (7) , 928-942
- https://doi.org/10.1089/cmb.2005.12.928
Abstract
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.Keywords
This publication has 32 references indexed in Scilit:
- STAR: an algorithm to Search for Tandem Approximate RepeatsBioinformatics, 2004
- Exhaustive whole-genome tandem repeats searchBioinformatics, 2004
- An Algorithm for Approximate Tandem RepeatsJournal of Computational Biology, 2001
- On the Distribution of K-tuple Matches for Sequence Homology: A Constant Time Exact Calculation of the VarianceJournal of Computational Biology, 1998
- Identifying Satellites and Periodic Repetitions in Biological SequencesJournal of Computational Biology, 1998
- Simple sequence repeats as a source of quantitative genetic variationTrends in Genetics, 1997
- A novel gene containing a trinucleotide repeat that is expanded and unstable on Huntington's disease chromosomesCell, 1993
- Identification of a gene (FMR-1) containing a CGG repeat coincident with a breakpoint cluster region exhibiting length variation in fragile X syndromePublished by Elsevier ,1991
- Toward a Unified Approach to Genetic Mapping of Eukaryotes Based on Sequence Tagged Microsatellite SitesNature Biotechnology, 1990
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984