Efficient multiple genome alignment

Bioinformatics

Volumn 18, Issue , 2002, Pages S312-S320

  Höhl, Michael ^a   Kurtz, Stefan ^a   Ohlebusch, Enno ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Efficient algorithms; Genome comparison; Graph algorithms; Multiple alignment; Suffix trees

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; CHROMOSOME MAP; COMPARATIVE STUDY; COMPUTER PROGRAM; DNA SEQUENCE; EVALUATION; GENE EXPRESSION PROFILING; HUMAN; METHODOLOGY; MOLECULAR EVOLUTION; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE; PHYLOGENY; SEQUENCE ALIGNMENT; SEQUENCE HOMOLOGY; ADENOVIRUS; CONFERENCE PAPER; ESCHERICHIA COLI; GENOME; NONHUMAN; PRIORITY JOURNAL;

ALGORITHMS; ANIMALS; BASE SEQUENCE; CHROMOSOME MAPPING; EVOLUTION, MOLECULAR; GENE EXPRESSION PROFILING; HUMANS; MOLECULAR SEQUENCE DATA; PHYLOGENY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SEQUENCE HOMOLOGY, NUCLEIC ACID; SOFTWARE;

HUMAN ADENOVIRUS;

EID: 0242470267     PISSN: 13674803     EISSN: None     Source Type: Journal    
DOI: 10.1093/bioinformatics/18.suppl_1.S312     Document Type: Article

References (23)

1. Altschul, S., Madden, T., SchaÌffer, A., Zhang, J., Zhang, Z., Miller, W. and Lipman, D. (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res., 25, 3389-3402.
2. Arkin, E. and Silverberg, E. (1987) Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18, 1-8.
3. Batzoglu, S., Pachter, L., Mesirov, J., Berger, B. and Lander, E. (2000) Human and mouse gene structure: comparative analysis and application to exon prediction. Genome Res., 10, 950-958.
4. Buhler, J. (2001) Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics, 17, 419-428.
5. Cormen, T., Leiserson, C. and Rivest, R. (1990) Introduction to Algorithms. MIT Press, Cambridge, MA.
6. Delcher, A., Kasif, S., Fleischmann, R., Peterson, J., White, O. and Salzberg, S. (1999) Alignment of whole genomes. Nucleic Acids Res., 27, 2369-2376.
7. Durbin, R., Eddy, S., Krogh, A. and Mitchison, G. (1998) Biological Sequence Analysis. Cambridge University Press.
8. Gusfield, D. (1997) Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York.
9. Jacobson, G. and Vo, K. (1992) Heaviest increasing/common sub-sequence problems. In Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching, Tucson, Arizona, April/May 1992, Lecture Notes in Computer Science, 644, Springer, pp. 52-66.
10. Joseph, D., Meidanis, J. and Tiwari, P. (1992) Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. In Proceedings of the Third Scandinavian Workshop on Algorithm Theory, Helsinki 1992, Lecture Notes in Computer Science, 621, Springer, pp. 326-337.
11. Kasai, T., Lee, G., Arimura, H., Arikawa, S. and Park, K. (2001) Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and its Applications. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, Jerusalem, Israel, July 2001, Lecture Notes in Computer Science, 2089, Springer, pp. 181-192.
12. Kent, W. and Zahler, A. (2000) Conservation, regulation, synteny, and introns in large-scale C. briggsae-C. elegans genomic alignment. Genome Res., 10, 1115-1125.
13. Kurtz, S., Choudhuri, J., Ohlebusch, E., Schleiermacher, C., Stoye, J. and Giegerich, R. (2001) REPuter: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res., 29, 4633-4642.
14. Lawler, E. (1976) Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
15. Manber, U. and Myers, E. (1993) Suffix arrays: a new method for on-line string searches. SIAM J. Comput., 22, 935-948.
16. McCreight, E. (1976) A space-economical suffix tree construction algorithm. J. ACM, 23, 262-272.
17. Miller, W. (2001) Comparison of genomic DNA sequences: solved and unsolved problems. Bioinformatics, 17, 391-397.
18. Myers, E. and Miller, W. (1995) Chaining multiple-alignment fragments in sub-quadratic time. In Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms. San Francisco, pp. 38-47.
19. Needleman, S. and Wunsch, C. (1970) A general method applicable to the search for similarities in the amino-acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
20. Thompson, J., Higgins, D. and Gibson, T. (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucleic Acids Res., 22, 4673-4680.
21. Ukkonen, E. (1985) Algorithms for approximate string matching. Information and Control, 64, 100-118.
22. Vingron, M. and Argos, P. (1989) A fast and sensitive multiple alignment algorithm. Comput. Appl. Biosci., 5, 115-121.
23. Weiner, P. (1973) Linear Pattern Matching Algorithms. In Proceedings of the 14th IEEE Annual Symposium on Switching and Automata Theory. The University of Iowa, pp. 1-11.