Alignment between two multiple alignments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2676, Issue , 2003, Pages 254-265

  Ma, Bin ^a   Wang, Zhuozhi ^a   Zhang, Kaizhong ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; DYNAMIC PROGRAMMING; PATTERN MATCHING;

ARITHMETIC OPERATIONS; DYNAMIC PROGRAMMING ALGORITHM; GAP OPENING; MULTIPLE ALIGNMENT; MULTIPLE SEQUENCE ALIGNMENTS; NON-TRIVIAL; NP COMPLETE;

HEURISTIC ALGORITHMS;

EID: 35248843117     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_19     Document Type: Article

References (12)

1. E.L. Anson and G. Myers. Realigner: a program for refining dna sequence multi-alignments. In Proceedings of the First ACM conference on Computational Molecular Biology, pages 9-13, 1997.
2. P. Bonizzoni and G. Della Vedova. The complexity of multiple sequence alignment with sp-score that is a metric. Theorectical Computer Science, 259(1):63-79, 2001.
3. O. Gotoh. An improved algorithm for matching biological sequences. Journal of Molecular Biology, 162:705-708, 1982.
4. O. Gotoh. Optimal alignment between groups of sequences and its application to multiple sequence alignment. Computer Application in the Biosciences, 9(3):361-370, 1993.
5. D. Gusfield. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology, 55:141-154, 1993.
6. W. Just. Computational complexity of multiple sequence alignment with sp-score. Journal of computational biology, 8(6):615-623, 2001.
7. J. D. Kececioglu and W. Zhang. Aligning alignments. In Proceedings of the Ninth Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 1448, pages 189-208. Springer-Verlag, 1998.
8. G. Myers, S. Selznick, Z. Zhang, and W. Miller. Progressive multiple alignment with constraints. In Proceedings of the First ACM conference on Computational Molecular Biology, pages 220-225, 1997.
9. S.B. Needleman and C.D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
10. C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. System Sciences, 43:425-440, 1991.
11. L. Wang and T. Jiang. On the complexity of multiple sequence alignment. Journal of computational biology, 1(4):337-448, 1994.
12. Z. Wang and K. Zhang. Alignment between rna structures. In Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 2136, pages 690-702. Springer-Verlag, 2001.