Computational Complexity of Multiple Sequence Alignment with SP-Score

It is shown that the multiple alignment problem with SP-score is NP-hard for each scoring matrix in a broad class M that includes most scoring matrices actually used in biological applications. The problem remains NP-hard even if sequences can only be shifted relative to each other and no internal gaps are allowed. It is also shown that there is a scoring matrix M(0) such that the multiple alignment problem for M(0) is MAX-SNP-hard, regardless of whether or not internal gaps are allowed.

[1]  G. Gonnet,et al.  Empirical and structural models for insertions and deletions in the divergent evolution of proteins. , 1993, Journal of molecular biology.

[2]  P. Argos,et al.  Analysis of insertions/deletions in protein structures. , 1992, Journal of molecular biology.

[3]  Paola Bonizzoni,et al.  The complexity of multiple sequence alignment with SP-score that is a metric , 2001, Theor. Comput. Sci..

[4]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[5]  D. Lipman,et al.  The multiple sequence alignment problem in biology , 1988 .

[6]  M. O. Dayhoff,et al.  22 A Model of Evolutionary Change in Proteins , 1978 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Tao Jiang,et al.  Some open problems in computational molecular biology , 1999, SIGA.

[9]  W. Wheeler,et al.  The Triangle Inequality and Character Analysis , 1993 .

[10]  Tao Jiang,et al.  On the Complexity of Multiple Sequence Alignment , 1994, J. Comput. Biol..

[11]  Kenneth H. Fasman,et al.  Chapter 3 - An introduction to biological sequence analysis , 1998 .

[12]  S. Henikoff,et al.  Amino acid substitution matrices from protein blocks. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[13]  V. Rich.  Personal communication , 1989, Nature.

[14]  Simon Kasif,et al.  Computational methods in molecular biology , 1998 .

[15]  M. O. Dayhoff,et al.  Atlas of protein sequence and structure , 1965 .

[16]  Wm Fitch.  Commentary on the Letter from Ward C. Wheeler , 1993 .

[17]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[18]  Carsten Lund,et al.  Hardness of approximations , 1996 .