Multiple Sequence Alignment as a Facility-Location Problem

A connection is made between certain multiple-sequence alignment problems and facility-location problems, and the existence of a PTAS (polynomial-time approximation scheme) for these problems is shown. Moreover, it is shown that multiple sequence alignment with SP-score and fixed gap penalties is MAX SNP-hard.

[1]  Bodo Manthey,et al.  Non-approximability of weighted multiple sequence alignment , 2003, Theor. Comput. Sci..

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

[3]  Chuan Yi Tang,et al.  A polynomial time approximation scheme for minimum routing cost spanning trees , 1998, SODA '98.

[4]  Arie Tamir.  A distance constrainedp-facility location problem on the real line , 1994, Math. Program..

[5]  P. Pevzner.  Multiple alignment, communication cost, and graph matching , 1992 .

[6]  Eugene L. Lawler,et al.  Approximation Algorithms for Multiple Sequence Alignment , 1994, Theor. Comput. Sci..

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

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

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

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

[11]  Bin Ma,et al.  Finding similar regions in many strings , 1999, STOC '99.

[12]  D Gusfield,et al.  Efficient methods for multiple sequence alignment with guaranteed error bounds , 1993, Bulletin of mathematical biology.

[13]  Marek Karpinski,et al.  Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..

[14]  Todd Wareham,et al.  A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment , 1995, J. Comput. Biol..

[15]  Viggo Kann,et al.  Hardness of Approximating Problems on Cubic Graphs , 1997, CIAC.

[16]  Bin Ma,et al.  Finding Similar Regions in Many Sequences , 2002, J. Comput. Syst. Sci..

[17]  Tao Jiang,et al.  Orchestrating quartets: approximation and data correction , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[19]  David J. Lipman,et al.  MULTIPLE ALIGNMENT , COMMUNICATION COST , AND GRAPH MATCHING * , 1992 .

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

[21]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[22]  Isaac Elias.  Settling the Intractability of Multiple Alignment , 2003, ISAAC.

[23]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[24]  Esther M. Arkin,et al.  Minimum-diameter covering problems , 2000 .

[25]  Winfried Just,et al.  Computational Complexity of Multiple Sequence Alignment with SP-Score , 2001, J. Comput. Biol..