Abstract
Alignment of two multiple alignments arises naturally when constructing approximate multiple sequence alignments progressively. In this paper, we consider the problem of alignment of two multiple alignments with SP-score and linear gap costs.
When there is no gap opening cost, this problem can be solved using the well-known dynamic programming algorithm for two sequences by viewing each column in the multiple alignments as an element. However if there are gap opening costs (sometimes referred as affine gap costs) then the problem becomes non-trivial. Gotoh [4] suggested a procedure for this problem and stated that “the total arithmetic operations used is close to (quadratic) in typical cases”. Kececioglu and Zhang [7] gave heuristic algorithms based on optimistic and pessimistic gap counts and conjectured that this problem is NP-complete. In this paper we prove that this problem is indeed NP-complete and therefore settle this open problem. We then propose another heuristic algorithm for this problem.
Research supported partially by the Natural Sciences and Engineering Research Council of Canada under Grant OGP0046373 and RGP0238748 and a Sharcnet research fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E.L. Anson and G. Myers. Realigner: a program for refining dna sequence multialignments. In Proceedings of the First ACM conference on Computational Molecular Biology, pages 9–13, 1997.
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.
O. Gotoh. An improved algorithm for matching biological sequences. Journal of Molecular Biology, 162:705–708, 1982.
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.
D. Gusfield. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology, 55:141–154, 1993.
W. Just. Computational complexity of multiple sequence alignment with sp-score. Journal of computational biology, 8(6):615–623, 2001.
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.
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.
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.
C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. System Sciences, 43:425–440, 1991.
L. Wang and T. Jiang. On the complexity of multiple sequence alignment. Journal of computational biology, 1(4):337–448, 1994.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, B., Wang, Z., Zhang, K. (2003). Alignment between Two Multiple Alignments. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds) Combinatorial Pattern Matching. CPM 2003. Lecture Notes in Computer Science, vol 2676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44888-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-44888-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40311-1
Online ISBN: 978-3-540-44888-4
eBook Packages: Springer Book Archive