Aligning alignments exactly

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn 8, Issue , 2004, Pages 85-96

  Kececioglu, John ^a   Starrett, Dean ^a  

^a University of Arizona   (United States)

Author keywords

Exact algorithms; Linear gap costs; Multiple sequence alignment; Sum of pairs

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTER SIMULATION; HEURISTIC PROGRAMMING; PROGRAM PROCESSORS; THRESHOLD LOGIC;

COMPUTATIONAL BIOLOGY; DATASETS; GAP COUNT ACCURACY; LINEAR GAP COST; MULTIPLE SEQUENCE ALIGNMENT; SIMULATED DATA;

COMPUTATIONAL COMPLEXITY;

EID: 2442608622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/974614.974626     Document Type: Conference Paper

References (45)

1. Altschul, S. "Gap costs for multiple sequence alignment." Journal of Theoretical Biology 138, 297-309, 1989.
2. Anson, E. and E. Myers. "ReAligner: a program for refining DNA sequence multi-alignments." Journal of Computational Biology 4:3, 369-383, 1997.
3. Bafna, V., E. Lawler and P. Pevzner. "Approximation algorithms for multiple sequence alignment." Proceedings of the 5th Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 807, 43-53, 1994.
4. Berger, M. and P. Munson. "A novel randomized iterative strategy for aligning multiple protein sequences." Computer Applications in the Biosciences 7, 479-484, 1991.
5. Carrillo, H. and D. Lipman. "The multiple sequence alignment problem in biology." SIAM Journal on Applied Mathematics 48, 1073-1082, 1988.
6. Feng, D. and R. Doolittle. "Progressive sequence alignment as a prerequisite to correct phylogenetic trees." Journal of Molecular Evolution 25, 351-360, 1987.
7. Fitch, W. and T. Smith. "Optimal sequence alignments." Proceedings of the National Academy of Science USA 80, 1382-1386, 1981.
8. Fredman, M. "Algorithms for computing evolutionary similarity measures with length independent gap penalties." Bulletin of Mathematical Biology 46:4, 553-566, 1984.
9. Garey, M. and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
10. Garey, M., D. Johnson and L. Stockmeyer. "Some simplified NP-complete graph problems." Theoretical Computer Science 1, 237-267, 1976.
11. Dayhoff, M.O., R.M. Schwartz, and B.C. Orcutt. "A model of evolutionary change in proteins." Atlas of Protein Sequence and Structure 5, 345-352, 1978.
12. Gotoh, O. "An improved algorithm for matching biological sequences." Journal of Molecular Biology 162, 705-708, 1982.
13. Gotoh, O. "Alignment of three biological sequences with an efficient traceback procedure." Journal of Theoretical Biology 121, 327-337, 1986.
14. Gotoh, O. "Optimal alignment between groups of sequences and its application to multiple sequence alignment." Computer Applications in the Biosciences 9:3, 361-370, 1993.
15. Gotoh, O. "Further improvement in methods of group-to-group sequence alignment with generalized profile operations." Computer Applications in the Biosciences 10:4, 379-387, 1994.
16. Gotoh, O. "Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments." Journal of Molecular Biology 264, 823-838, 1996.
17. Gupta, S., J. Kececioglu and A. Schäffer. "Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment." Journal of Computational Biology 2:3, 459-472, 1995.
18. Gusfield, D. "Efficient methods for multiple sequence alignment with guaranteed error bounds." Bulletin of Mathematical Biology 55:1, 141-154, 1993.
19. Hirosawa, M., Y. Totoki, M. Hoshida and M. Ishikawa. "Comprehensive study on iterative algorithms of multiple sequence alignment." Computer Applications in the Biosciences 11:1, 13-18, 1995.
20. Hirschberg, D. "A linear space algorithm for computing maximal common subsequences." Communications of the ACM 18:6, 341-343, 1975.
21. Jiang, T., E. Lawler and L. Wang. "Aligning sequences via an evolutionary tree: complexity and approximation." Proceedings of the 26th ACM Symposium on the Theory of Computing, 760-769, 1994.
22. Kececioglu, J. "The maximum trace problem in multiple sequence alignment." Proceedings of the 4th Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 684, 106-119, 1993.
23. Kececioglu, J., H.-P. Lenhof, K. Mehlhorn, P. Mutzel, K. Reinert and M. Vingron. "A polyhedral approach to sequence alignment problems." Discrete Applied Mathematics 104, 143-186, 2000.
24. Kececioglu, J. and D. Starrett. "Aligning alignments exactly." Technical Report 03-12, Department of Computer Science, The University of Arizona, September 2003. http://www.cs.arizona.edu/~kece/papers/KS03.pdf
25. Kececioglu, J. and W. Zhang. "Aligning alignments." Proceedings of the 9th Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 1448, 189-208, 1998.
26. Lipman, D., S. Altschul and J. Kececioglu. "A tool for multiple sequence alignment." Proceedings of the National Academy of Science USA 86, 4412-4415, 1989.
27. Ma, B., Z. Wang and K. Zhang. "Alignment between two multiple alignments." Proceedings of the 14th Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 2676, 254-265, 2003.
28. Maier, D. "The complexity of some problems on subsequences and supersequences." Journal of the ACM 25:2, 322-336, 1978.
29. McClure, M., T. Vasi and W. Fitch. "Comparative analysis of multiple protein-sequence alignment methods." Molecular Biology and Evolution 11, 571-592, 1994.
30. Myers, E. and M. Jain. "Going against the grain." Proceedings of the 3rd South American Workshop on String Processing, International Informatics Series 4, 203-213, 1996.
31. Myers, E. and W. Miller. "Optimal alignments in linear space." Computer Applications in the Biosciences 4, 11-17, 1988.
32. Myers, E., S. Selznick, Z. Zhang and W. Miller. "Progressive multiple alignment with constraints." Journal of Computational Biology 3:4, 563-572, 1996.
33. Pevzner, P. "Multiple alignment, communication cost, and graph matching." SIAM Journal on Applied Mathematics 52, 1763-1779, 1992.
34. Powell, D., L. Allison and T. Dix. "Fast, optimal alignment of three sequences using linear gap costs." Journal of Theoretical Biology 207, 325-336, 2000.
35. Ravi, R. and J. Kececioglu. "Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree." Discrete Applied Mathematics 88, 355-366, 1998.
36. Reinert, K., J. Stoye and T. Will. "An iterative method for faster sum-of-pairs multiple sequence alignment." Bioinformatics 16:9, 808-814, 2000.
37. Sankoff, D. "Minimal mutation trees of sequences." SIAM Journal on Applied Mathematics 78, 35-42, 1975.
38. Thompson, J., D. Higgins and T. Gibson. "CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalities and weight matrix choice." Nucleic Acids Research 22, 4673-4680, 1994.
39. Thompson, J., F. Plewniak and O. Poch. "A comprehensive comparison of multiple sequence alignment programs." Nucleic Acids Research 27:13, 2682-2690, 1999.
40. Thompson, J., F. Plewniak and O. Poch. "BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs." Bioinformatics 15:1, 87-88, 1999. http://www-igbmc.u-strasbg.fr/BioInfo/ BAliBASE2/
41. Wang, L. and D. Gusfield. "Improved approximation algorithms for tree alignment." Proceedings of the 7th Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 1075, 220-233, 1996.
42. Wang, L. and T. Jiang. "On the complexity of multiple sequence alignment." Journal of Computational Biology 1, 337-348, 1994.
43. Wareham, T. "A simplified proof of the NP- and MAX SNP-hardness of multiple sequence tree alignment." Journal of Computational Biology 2:4, 509-514, 1995.
44. Waterman, M. Introduction to Computational Biology: Maps, Sequences, and Genomes. Chapman and Hall, London, 1995.
45. Waterman, M. and M. Perlwitz. "Line geometries for sequence comparisons." Bulletin of Mathematical Biology 46, 567-577, 1984.