Tandem repeats over the edit distance

Bioinformatics

Volumn 23, Issue 2, 2007, Pages

  Sokol, Dina ^a   Benson, Gary ^b   Tojeira, Justin ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER MODEL; COMPUTER PROGRAM; CONFERENCE PAPER; DNA SEQUENCE; GENETIC ALGORITHM; GENETIC DISTANCE; MATHEMATICAL ANALYSIS; METHODOLOGY; PRIORITY JOURNAL; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY; STRUCTURAL GENOMICS; TANDEM REPEAT;

EUKARYOTA; PROKARYOTA;

EID: 33846664609     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btl309     Document Type: Conference Paper

References (27)

1. Benson,G. (1995) A space efficient algorithm for finding best scoring non-overlapping alignments. Theor. Comput. Sci., 145, 357-369.
2. Benson,G. (1997) Sequence alignment with tandem duplication. J. Comput. Biol., 4, 351-367.
3. Benson,G. (1999) Tandem repeats finder - a program to analyze DNA sequences. Nucleic Acids Res., 27, 573-580.
4. Collins,F.S. et al. (2003) The Human Genome Project: Lessons from large-scale biology. Science, 300, 286-290.
5. Frazier,M.E. et al. (2003) Realizing the potential of the genome revolution: The genomes to life program. Science, 300, 290-293.
6. Fu,Y.H. et al. (1992) An unstable triplet repeat in a gene related to myotonic muscular dystrophy. Science, 255, 1256-1258.
7. Groult,R., Leonard,M. and Mouchard,L. (2003) Speeding up the detection of evolutive tandem repeats. In Proceedings of The Prague Stringology Conference '03.
8. Groult,R. et al. (2004) Speeding up the detection of evolutive tandem repeats. Theor. Comput. Sci., 310, 309-328.
9. Hammock,E. and Young,L.J. (2005) Microsatellite instability generates diversity in brain and sociobehavioral traits. Science, 308, 1630-1634.
10. Jeffreys,A.J. (1993) DNA typing: Approaches and applications. J. Forensic Sci. Soc., 33, 204-211.
11. Kannan,S.K. and Myers,E.W. (1996) An algorithm for locating regions of maximum alignment score. SIAM J. Comput., 25, 648-662.
12. Katti,M.V. et al. (2000) Amino acid repeat patterns in protein sequences: Their diversity and structural-functional implications. Protein Sci., 9, 1203-1209.
13. Kitada,H. et al. (1996) Multiple alignment of biological sequences containing tandem repeats. Genome Inform., 7, 276-277.
14. Kolpakov,R. and Kucherov,G. (2001) Finding approximate repetitions under hamming distance. In Proceedings of the 9th European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Vol. 2161, pp. 170-181.
15. Kolpakov,R et al. (2003) mreps: Efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Res., 31, 3672-3678.
16. Landau,G.M. and Vishkin,U. (1989) Fast parallel and serial approximate string matching. J. Algorithm., 10, 157-169.
17. Landau,G.M. and Schmidt,J.P. (1993) An algorithm for approximate tandem repeats. In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Springer-Verlag, Vol. 648, pp. 120-133.
18. Landau,G.M. et al. (1998) Incremental string comparison. SIAM J. Comput., 27, 557-582.
19. Landau,G.M. et al. (2001) An algorithm for approximate tandem repeats. J. Comput. Biol., 8, 1-18.
20. Levenshtein,V.I. (1966) Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl., 10, 707-710.
21. Main,M.G. and Lorentz,R.J. (1994) An O(n logn) algorithm for finding all repetitions in a string. J. Algorithm., 422-432.
22. Schmidt,J.P. All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM J. Comput., 27, 972-992.
23. Spong,G. and Hellborg,L. (2002) A near-extinction event in lynx: Do microsatellite data tell the tale? Conserv. Ecol., 6, 15.
24. The International Human Genome Mapping Consortium. (2001), Initial sequencing and analysis of the human genome. Nature (Erratum (2001) Nature, 411, 720]. 409, 860-921.
25. Uform,M.W. and Wayne,R.K. (1993) Microsatellites and their application to population genetic studies. Curr. Opin. Genet. Dev., 3, 939-943.
26. Ukkonen,E. (1983) On approximate string matching. In Proceedings of the International Conference Foundations of Computation Theory, Lecture Notes in Computer Science 158, Springer-Verlag, pages 487-495.
27. Wexler,Y., Yakhini,Z., Kashi,Y. and Geiger,D. (2004) Finding approximate tandem repeats in genomic sequences. In Proceedings of the 8th Annual Conference on Research in Computational Molecular Biology (RECOMB).