TRStalker: An efficient heuristic for finding fuzzy tandem repeats

Bioinformatics

Volumn 26, Issue 12, 2010, Pages

  Pellegrini, Marco ^a   Renda, M Elena ^a   Vecchio, Alessio ^b  

^a CNR Istituto di Informatica e Telematica   (France)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EUKARYOTA;

ALGORITHM; ARTICLE; DNA SEQUENCE; GENETICS; GENOME; METHODOLOGY; TANDEM REPEAT;

ALGORITHMS; GENOME; SEQUENCE ANALYSIS, DNA; TANDEM REPEAT SEQUENCES;

EID: 77954187849     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq209     Document Type: Article

References (56)

1. Ames, D. et al. (2008) Comparative analyses of human single-and multilocus tandem repeats. Genetics, 179, 1693-1704.
2. Benson, G. (1998) An algorithm for finding tandem repeats of unspecified pattern size. In Istrail, S., Pevzner, P. and Waterman, M. (eds), Proceedings of the Second Annual international Conference on Computational Molecular Biology (New York, New York, United States, March 22-25, 1998), RECOMB '98. ACM, New York, NY, pp. 20-29.
3. Benson, G. (1999) Tandem repeats finder: a program to analyze DNAsequences. Nucleic Acids Res., 27, 573-580.Available at http://tandem.bu.edu/trf/trf.html (last accessed date April 27, 2010).
4. Boeva, V. et al. (2006) Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression. Bioinformatics, 22, 676-684.
5. Brodzik, A.K. (2007) Quaternionic periodicity transform: an algebraic solution to the tandem repeat detection problem. Bioinformatics, 23, 694-700.
6. Buchner, M. and Janjarasjitt, S. (2003) Detection and visualization of tandem repeats in DNA sequences. IEEE Trans. Signal Process, 51, 2280-2287.
7. Burkhardt, S. and Kärkkäinen, J. (2002) One-gapped q-grams filters for levenshtein distance. In Apostolico, A., Takeda, M. (eds), Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings. Vol. 2373 of Lecture Notes in Computer Science, Springer, pp. 225-234.
8. Burkhardt, S. and Kärkkäinen, J. (2003) Better filtering with gapped q-grams. Fundam. Inform., 56, 51-70.
9. Bussey, H. et al. (1995) The nucleotide sequence of chromosome I from Saccharomyces cerevisiae. Proc. Natl Acad. Sci. USA, 92, 3809-3813.
10. Campuzano, V. et al. (1996) Friedreich's ataxia: autosomal recessive disease caused by an intronic GAA triplet repeat expansion. Science, 271, 1423-1427.
11. de la Higuera, C. and Casacuberta, F. (2000) Topology of strings: median string is npcomplete. Theor. Comput. Sci., 230, 39-48.
12. Dujon, B. (1996) The yeast genome project: what did we learn? Trends Genet., 12, 263-270.
13. Elemento, O. and Gascuel, O. (2002) An efficient and accurate distance based algorithm to reconstruct tandem duplication trees. In Proceedings of the European Conference on Computational Biology (ECCB 2002), October 6-9, 2002, Saarbrücken, Germany. (Supplement of Bioinformatics), pp. 92-99.
14. Fischetti, V.A. et al. (1993) Identifying periodic occurrences of a template with applications to protein structure. Inf. Process. Lett., 45, 11-18.
15. Gelfand, Y. et al. (2007) TRDB - the tandem repeats database. Nucleic Acids Res., 35Database Issue, 80-87.
16. Glusman, G. et al. (2001) Comparative genomics of the human and mouse T cell receptor loci. Immunity, 15, 337-349.
17. Grissa, I. et al. (2007) The CRISPRdb database and tools to display CRISPRs and to generate dictionaries of spacers and repeats. BMC Bioinformatics, 8, 172.
18. Gupta, R. et al. (2007) A novel signal processing measure to identify exact and inexact tandem repeat patterns in DNAsequences. EURASIP. J. Bioinform. Syst. Biol. [Epub ahead of print, doi: 10.1155/2007/43596, March 13, 2007].
19. Gusfield, D. (1997) Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge, U.K.
20. Gusfield, D. and Stoye, J. (2004) Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci., 69, 525-546.
21. Hauth, A.M. and Joseph, D. (2002) Beyond tandem repeats: complex pattern structures and distant regions of similarity. In Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, August 3-7, 2002, Edmondon, Alberta, Canada, pp. 31-37.
22. Jiang, X. et al. (2003) Dynamic computation of generalised median strings. Pattern Anal. Appl., 6, 185-193.
23. Jurka, J. et al. (2005) Repbase update, a database of eukaryotic repetitive elements. Cytogenet. Genome Res., 110, 462-467.
24. Kelkar, Y.D.D. et al. (2008) The genome-wide determinants of human and chimpanzee microsatellite evolution. Genome Res., 18, 30-38.
25. Kolpakov, R. and Kucherov, G. (2003) Finding approximate repetitions under Hamming distance. Theor. Comput. Sci., 303, 135-156.
26. Kolpakov, R. et al. (2003) mreps: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Res., 31, 3672-3678. http://bioinfo.lifl.fr/mreps/ (last accessed date April 27, 2010).
27. Kolpakov, R.M. and Kucherov, G. (1999) Finding maximal repetitions in a word in linear time. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (October 17-18, 1999). FOCS, IEEE Computer Society, Washington, DC, p. 596.
28. Krishnan, A. and Tang, F. (2004) Exhaustive whole-genome tandem repeats search. Bioinformatics, 20, 2702-2710.
29. Kurtz, S. and Schleiermacher, C. (1999) Reputer: fast computation of maximal repeats in complete genomes. Bioinformatics, 15, 426-427.
30. Kurtz, S. et al. (2001) Reputer: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res., 29, 4633-4642.
31. Landau, G.M. et al. (2001) An algorithm for approximate tandem repeats. J. Comput. Biol., 8, 1-18.
32. Leclercq, S. et al. (2007) Detecting microsatellites within genomes: significant variation among algorithms. BMC Bioinformatics, 8, 1-125.
33. Legendre, M. et al. (2007) Sequence-based estimation of minisatellite and microsatellite repeat variability. Genome Res., 17, 1787-1796.
34. Motwani, R. and Raghavan, P. (1995) Randomized Algorithms. Cambridge University Press, Cambridge, UK.
35. Mudunuri, S.B. and Nagarajaram, H.A. (2007) Imex: Imperfect microsatellite extractor. Bioinformatics, 23, 1181-1187.
36. Mulmuley, K. (1993) Computational Geometry, an Introduction through Randomized Algorithms. Prentice Hall, Englewood Cliffs, New Jersey.
37. O'Dushlaine, C. et al. (2005) Tandem repeat copy-number variation in protein-coding regions of human genes. Genome Biology, 6, R69.
38. Parisi, V. et al. (2003) String: finding tandem repeats in DNAsequences. Bioinformatics, 19, 1733-1738.
39. Peterlongo, P. et al. (2009) Lossless filter for multiple repeats with bounded edit distance. Algorithms Mol. Biol., 4, 1-3.
40. Rivals, E. (2004) A survey on algorithmic aspects of tandem repeats evolution. Int. J. Found. Comput. Sci., 15, 225-257.
41. Rivals, E. et al. (1997) Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. Comput. Appl. Biosci., 13, 131-136.
42. Rowen, L. et al. (1996) The complete 685-kilobase DNA sequence of the human beta T Cell Receptor Locus. Science, 272, 1755-1762.
43. Saha, S. et al. (2008) Empirical comparison of ab initio repeat finding programs. Nucleic Acids Res., 36, 2284-2294.
44. Sammeth, M. and Stoye, J. (2006) Comparing tandem repeats with duplications and excisions of variable degree. IEEE/ACM Trans. Comput. Biology Bioinform., 3, 395-407.
45. Sharma, D. et al. (2004) Spectral repeat finder (SRF): identification of repetitive sequences using fourier transformation. Bioinformatics, 20, 1405-1412.
46. Sim, J.S. and Park, K. (2003) The consensus string problem for a metric is np-complete. J. Discrete Algorithms, 1, 111-117.
47. Smit, A.F.A. et al. (1996-2004). Repeatmasker open-3.0. http://www.repeatmasker.org/(last access date April 27, 2010).
48. Sokol, D. et al. (2007) Tandem repeats over the edit distance. Bioinformatics, 23, 30-35.
49. Stolovitzky, G. et al. (1999) Tandem repeat detection using pattern discovery with applications to the identification of yeast satellites. Technical Report RC21508, IBM T.J. Watson Research Labs.
50. Vissers, L.E. et al. (2009) Rare pathogenic microdeletions and tandem duplications are microhomology-mediated and stimulated by local genomic architecture. Hum. Mol. Genet., 18, 3579-3593.
51. Vogler, A. et al. (2006) Effect of repeat copy number on variable-number tandem repeat mutations in Escherichia coli O157:H7. J. Bacteriol., 188, 4253-4563.
52. Warburton, P. et al. (2008) Analysis of the largest tandemly repeated DNA families in the human genome. BMC Genomics, 9, 533.
53. Wells, R.D. (2008) DNA triplexes and Friedreich ataxia. FASEB J., 22, 1625-1634.
54. Wexler, Y. et al. (2004) Finding approximate tandem repeats in genomic sequences. In Proceedings of the Eighth Annual International Conference on Resaerch in Computational Molecular Biology (RECOMB 2004), New York, NY, USA. ACM. pp. 223-232.
55. Wexler, Y. et al. (2005) Finding approximate tandem repeats in genomic sequences. J. Comput. Biol., 12, 928-942.
56. Wooster, R. et al. (1994) Instability of short tandem repeats (microsatellites) in human cancers. Nat. Genet., 6, 152-156.