REPuter: Fast computation of maximal repeats in complete genomes

Bioinformatics

Volumn 15, Issue 5, 1999, Pages 426-427

  Kurtz, Stefan ^a   Schleiermacher, Chris ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PALINDROMIC DNA;

ARTICLE; CALCULATION; COMPUTER PROGRAM; GENE SEQUENCE; PRIORITY JOURNAL;

EID: 0033066718     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/15.5.426     Document Type: Article

References (8)

1. Agarwal, P. and States, D. (1994) The repeat pattern toolkit (rpt): Analyzing the structure and evolution of the c. elegans genome. Proc. ISMB '94, pp. 1-9.
2. Devereux, J., Haeberli, P. and Smithies, O. (1984) A comprehensive set of sequence analysis programs for the VAX. Nucleic Acids Res., 12, 387-395.
3. Gusfield, D. (1997) Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York.
4. Kurtz, S. (1998) Reducing the space requirement of suffix trees. Report 98-03, Technische Fakultät, Universität Bielefeld.
5. Leung, M., Blaisdell, B., Burge, C. and Karlin, S. (1991) An efficient algorithm for identifying matches with errors in multiple long molecular sequences. J. Mol. Biol., 221, 1367-1378.
6. Martinez, H. (1983) An efficient method for finding repeats in molecular sequences. Nucleic Acids Res., 11, 4629-4634.
7. McCreight, E. (1976) A space-economical suffix tree construction algorithm. JACM, 23, 262-272.
8. Rivals, É., Dauchet, M., Delahaye, J. and Delgrange, O. (1997) Fast discerning repeats in DNA sequences with a compression algorithm. Proceedings of the Workshop on Genome and Informatics, Tokyo.