An efficient algorithm for finding short approximate non-tandem repeats

Bioinformatics

Volumn 17, Issue SUPPL. 1, 2001, Pages

  Adebiyi, Ezekiel F ^a   Jiang, Tao ^b   Kaufmann, Michael ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; GENETIC DATABASE; NUCLEOTIDE REPEAT;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DATABASES, GENETIC; REPETITIVE SEQUENCES, NUCLEIC ACID;

EID: 3242886441     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/17.suppl_1.S5     Document Type: Article

References (11)

1. Bairoch, A. (1992). Prosite: a dictionary of sites and patterns in proteins. Nucleic Acids Res. 20(Suppl), 2013-2017.
2. Blumer, A., A. Ehrenfeucht, et al. (1989). Average size of suffix trees and dawgs. Discrete Applied Mathematics 24, 37-45.
3. Delcher, A., S. Kasif, et al. (1999). Alignment of whole genomes. Nucleic Acids Research 27(11), 2369-2376.
4. Gusfield, D. (1997). Algorithms on strings, trees and sequences. Cambridge University Press, New York.
5. Hodgman, T. (1989). The elucidation of protein function by sequence motif analysis. Comput. Applic. Biosci. 5, 1-13.
6. Kurtz, S., E. Ohlebusch, et al. (2000). Computation and visualization of degenerate repeats in complete genomes. ISMB Conf., 228-238.
7. Kurtz, S. and C. Schleiermacher (1999). Reputer: fast computation of maximal repeats in complete genomes. Bioinformatics 15(5), 426-427.
8. Myers, E. (1994). A sub-linear algorithm for approximate keyword matching. Algorithmica 12(4-5), 345-374.
9. Sagot, M.-F. (1998). Spelling approximate repeated or common motifs using a suffix tree. LNCS 1380, 111-127.
10. TIGR (1999). Repeat-finder. http://mww.tigre.org/tdb/rice /repeatinfo-MUMmer.shtml.
11. Ukkonen, E. (1985). Algorithms for approximate string matching. Information and Control 64, 100-118.