Repseek, a tool to retrieve approximate repeats from large DNA sequences

Bioinformatics

Volumn 23, Issue 1, 2007, Pages 119-121

  Achaz, Guillaume ^a,b   Boyer, Frédéric ^c   Rocha, Eduardo P C ^a,d   Viari, Alain ^c   Coissac, Eric ^c,e  

^a SORBONNE UNIVERSITÉ   (France)

^b INRIA Rhône Alpes Projet HELIX ^*  (France)

^c INRIA RHÔNE ALPES   (France)

^d INSTITUT PASTEUR   (France)

^e UNIV GRENOBLE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

REPETITIVE DNA;

ARTICLE; BACTERIAL GENOME; CAENORHABDITIS ELEGANS; CHROMOSOME ANALYSIS; COMPUTER PROGRAM; DNA SEQUENCE; DNA STRUCTURE; ESCHERICHIA COLI; GENETIC ALGORITHM; NONHUMAN; PRIORITY JOURNAL; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; STATISTICAL ANALYSIS; STRUCTURAL BIOINFORMATICS;

EID: 33845869791     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btl519     Document Type: Article

References (15)

1. Abouelhoda,M.I., Kurtz,S. and Ohlebusch,E. (2002) The enhanced suffix array and its applications to genome analysis. In Proceedings of the Second Workshop on Algorithms in Bioinformatics. Lecture Notes in Computer Science 2452, Springer-Verlag, pp. 449-463.
2. Achaz,G. et al. (2003) Associations between inverted repeats and the structural evolution of bacterial genomes. Genetics, 164, 1279-1289.
3. Altschul,S.F. et al. (1997) Gapped blast and psi-blast: A new generation of protein database search programs. Nucleic Acids Res., 25, 3389-3402.
4. Bao,Z. and Eddy,S.R. (2002) Automated de novo identification of repeat sequence families in sequenced genomes. Genome Res., 12, 1269-1276.
5. Karlin,S. and Altschul,S.F. (1993) Applications and statistics for multiple high-scoring segments in molecular sequences. Proc. Natl Acad. Sci. USA, 90, 5873-5877.
6. Karlin,S. and Ost,F. (1985) Maximal segmental match length among random sequences from a finite alphabet. In Cam,L.M.L. and Olshen,R.A. (eds), Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer. Association for Computing Machinery, NY, Vol. 1, pp. 225-243.
7. Karp,R.M., Miller,R.E. and Rosenberg,A.L. (1972) Rapid identification of repeated patterns in strings, trees and array. In 4th annual ACM symposium theory of computing, ACM, pp. 125-136.
8. Kurtz,S. and Schleiermacher,C. (1999) Reputer: Fast computation of maximal repeats in complete genomes. Bioinformatics, 15, 426-427.
9. Pevzner,P.A. et al. (2004) De novo repeat classification and fragment assembly. Genome Res., 14, 1786-1796.
10. Price,A.L., Jones,N.C. and Pevzner,P.A. (2005) De novo identification of repeat families in large genomes. Bioinformatics, 21, i351-i358.
11. Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
12. Smit,A.F.A, Hubley,R. and Green,P. (1996-2004), RepeatMasker Open-3.0.
13. Vincens,P. et al. (1998) A strategy for finding regions of similarity in complete genome sequences. Bioinformatics, 14, 715-725.
14. Waterman,M.S. and Eggert,M. (1987) A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons. J. Mol. Biol., 197, 723-728.
15. Waterman,M.S. and Vingron,M. (1994) Rapid and accurate estimates of statistical significance for sequence data base searches. Proc. Natl Acad. Sci. USA, 91, 4625-4628.