Computation and Visualization of Degenerate Repeats in Complete Genomes

Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, ISMB 2000

Volumn , Issue , 2000, Pages 228-238

  Kurtz, Stefan ^a   Ohlebusch, Enno ^a   Schleiermacher, Chris ^a   Stoye, Jens ^b   Giegerich, Robert ^a  

^a BIELEFELD UNIVERSITY   (Germany)

^b GERMAN CANCER RESEARCH CENTER DKFZ   (Germany)

Author keywords

Degenerate Repeats; Efficient Algorithms; Genome; Software Tool; Visualization

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL EFFICIENCY; GENES;

ALGORITHMICS; COMPLETE GENOMES; DEGENERATE REPEAT; EFFICIENT ALGORITHM; GENOME; GENOMIC DNA; GENOMICS; REPETITIVE STRUCTURE; SOFTWARE-TOOLS; SYSTEMATIC STUDY;

VISUALIZATION;

ALGORITHM; ANIMAL; ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; GENOME; HUMAN; METHODOLOGY; NUCLEOTIDE REPEAT;

ALGORITHMS; ANIMALS; GENOME; HUMANS; REPETITIVE SEQUENCES, NUCLEIC ACID; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 0034565346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Agarwal, P., and States, D. J. 1994. The Repeat Pattern Toolkit (RPT): Analyzing the structure and evolution of the C. elegans genome. In Proc. of the Second International Conference on Intelligent Systems for Molecular Biology, ISMB 94, 1-9. Menlo Park, CA: AAAI Press.
2. Babenko, V. N.; Kosarev, P. S.; Vishnevsky, O. V.; Levitsky, V. G.; Basin, V. V.; and Prolov, A. S. 1999. Investigating extended regulatory regions of genomic DNA sequences. Bioinformatics 15 (7/8) :644-653.
3. Benson, G., and Waterman, M. 1994. A method for fast database search for all k-nucleotide repeats. Nucl. Acids Res. 22:4828-4836.
4. Benson, G. 1994. A space efficient algorithm for finding the best nonoverlapping alignment score. In Crochemore, M., and Gusfield, D., eds., Proc. of the 5th Annual Symposium, on Combinatorial Pattern Matching, CPM 94. Asilomar, California, June 1994, volume 807 of LNCS, 1-14. Berlin: Springer Verlag.
5. Benson, G. 1999. Tandem repeats finder: A program to analyze DNA sequences. Nucl. Acids Res. 27 (2) :573-580.
6. Delcher, A.; Kasif, S.; Fleischmann, R.; Peterson, J.; White, O.; and Salzberg, S. 1999. Alignment of Whole Genomes. Nucleic Acids Research 27:2369-2376.
7. Dunham, I.; Shimizu, N.; Roe, B. A.; and Chissoe, S. 1999. The DNA sequence of human chromosome 22. Nature 402:489-495.
8. Fitch, W.; Smith, T.; and Breslow, J. 1986. Detecting internally repeated sequences and inferring the history of duplication. In Segrest, J. P., and Albers, J. J., eds., Plasma Proteins. Part A: Preparation, Structure, and Molecular Biology, volume 128 of Methods in Enzymology. San Diego, CA: Academic Press. chapter 45, 773-788.
9. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences. New York: Cambridge University Press.
10. Harel, D., and Tarjan, R. 1984. Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Computing 13:338-355.
11. Huang, C.; Lin, Y.; Yang, Y.; Huang, S.; and Chen, C. 1998. The telomeres of streptomyces chromosomes contain conserved palindromic sequences with potential to form complex secondary structures. J. Mol. Biol. 28 (5) :905-16.
12. Kannan, S. K., and Myers, E. W. 1996. An algorithm for locating nonoverlapping regions of maximum alignment score. SIAM J. Computing 25 (3) :648-662.
13. Kurtz, S., and Myers, G. 1997. Estimating the Probability of Approximate Matches. In Proc. of the 8th Annual Symposium on Combinatorial Pattern Matching, Aarhus, Denmark, June/July 1997, 52-64. Lecture Notes in Computer Science 1264, Springer Verlag.
14. Kurtz, S., and Schleiermacher, C. 1999. REPuter: Fast Computation of Maximal Repeats in Complete Genomes. Bioinformatics 15 (5) :426-427.
15. Kurtz, S. 1999. Reducing the Space Requirement of Suffix Trees. Software-Practice and Experience 29 (13) :1149-1171.
16. Landau, G. M., and Schmidt, J. P. 1993. An algorithm for approximate tandem repeats. In Apostolico, A.; Crochemore, M.; Galil, Z.; and Manber, U., eds., Proc. of the 4th Annual Symposium on Combinatorial Pattern Matching, CPM 93. Padova, Italy, June 1993, volume 684 of LNCS, 120-133. Berlin: Springer Verlag.
17. Leung, M.-Y.; Blaisdell, B. E.; 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.
18. McConkey, M. 1993. Human Genetics: The Molecular Revolution. Boston, MA: Jones and Bartlett.
19. Rivals, E.; Delgrange, O.; Delahaye, J.-P.; Dauchet, M.; Delorme, M.-O.; Henaut, A.; and Ollivier, E. 1997. Detection of significant patterns by compression algorithms: The case of approximate tandem repeats in DNA sequences. CABIOS 13:131-136.
20. Sagot, M.-F., and Myers, E. W. 1998. Identifying satellites and periodic repetitions in biological sequences. J. Comp. Biol. 5 (3) :539-553.
21. Sagot, M.-F.; Escalier, V.; Viari, A.; and Soldano, H. 1995. Searching for repeated words in a text allowing for mismatches and gaps. In Baeza-Yates, R., and Manber, U., eds., The Second South American Workshop on String Processing. Vinos de Mar, Chili, 1995. Proceedings, 87-100.
22. Sagot, M.-F. 1998. Spelling approximate repeated or common motifs using a suffix tree. In Proc. of the Third Latin American Symposium on Theoretical Informatics, LATIN 98, volume 1380 of LNCS, 111-127. Berlin: Springer Verlag.
23. Schieber, B., and Vishkin, U. 1988. On Finding Lowest Common Ancestors. SIAM J. Computing 17 (6) :1253-1263.
24. Schmidt, J. P. 1998. All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM J. Computing 27 (4) :972-992.
25. Ukkonen, E. 1985. Algorithms for Approximate String Matching. Information and Control 64:100-118.
26. van Belkum, A.; Scherer, S.; van Leeuwen, W.; Willemse, D.; van Alphen, L.; and Verbrugh, H. 1997. Variable number of tandem repeats in clinical strains of haemophilus influenzae. Infect. Immun. 65 (12) :5017-27.
27. Vincens, P.; Buffat, L.; Andre, C.; Chevrolat, J.-P.; Boisvieux, J.-F.; and Hazout, S. 1998. A strategy for finding regions of similarity in complete genome sequences. Bioinformatics 14 (8) :715-725.
28. Wagner, R., and Fischer, M. 1974. The String to String Correction Problem. Journal of the ACM 21 (1) :168-173.
29. Waterman, M. S.; Arratia, R.; and Galas, D. J. 1984. Pattern recognition in several sequences: Consensus and alignment. Bull. Math. Biol. 46 (4) :515-527.
30. Zawinski, J. 1994. Remote Control of UNIX Netscape. http://home.netscape.com/newsref/std/x-remote.html.