The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility

We show that two important problems that have applications in computational biology are ASP-complete, which implies that, given a solution to a problem, it is NP-complete to decide if another solution exists. We show first that a variation of BETWEENNESS, which is the underlying problem of questions related to radiation hybrid mapping, is ASP-complete. Subsequently, we use that result to show that QUARTET COMPATIBILITY, a fundamental problem in phylogenetics that asks whether a set of quartets can be represented by a parent tree, is also ASP-complete. The latter result shows that Steel's QUARTET CHALLENGE, which asks whether a solution to QUARTET COMPATIBILITY is unique, is coNP-complete.

[1]  Chris Dowden.  On the maximum size of minimal definitive quartet sets , 2010, Discret. Math..

[2]  Charles Semple,et al.  Quartet Compatibility and the Quartet Graph , 2008, Electron. J. Comb..

[3]  Ramm,et al.  Fixed-Parameter Algorithms in Phylogenetics , 2007 .

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

[5]  Laurent Juban,et al.  Dichotomy Theorem for the Generalized Unique Satisfiability Problem , 1999, FCT.

[6]  Tao Jiang,et al.  Quartet Cleaning: Improved Algorithms and Simulations , 1999, ESA.

[7]  Mike A. Steel,et al.  Algorithmic Aspects of Tree Amalgamation , 2000, J. Algorithms.

[8]  Madhu Sudan,et al.  A Geometric Approach to Betweenness , 1995, ESA.

[9]  G. Gyapay,et al.  A radiation hybrid map of the human genome. , 1996, Human molecular genetics.

[10]  Olivier Gascuel,et al.  Inferring evolutionary trees with strong combinatorial evidence , 1997, Theor. Comput. Sci..

[11]  M. Steel.  The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[12]  Tandy J. Warnow,et al.  A few logs suffice to build (almost) all trees (I) , 1999, Random Struct. Algorithms.

[13]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[14]  R. Myers,et al.  Radiation hybrid mapping: a somatic cell genetic method for constructing high-resolution maps of mammalian chromosomes. , 1990, Science.

[15]  M. Steel,et al.  Extension Operations on Sets of Leaf-Labeled Trees , 1995 .

[16]  Jaroslav Opatrny,et al.  Total Ordering Problem , 1979, SIAM J. Comput..

[17]  Dan Pelleg,et al.  From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution , 1998, RECOMB '98.

[18]  Michel Habib,et al.  Unique Perfect Phylogeny Is NP-Hard , 2010, CPM.

[19]  Paul Stothard,et al.  A first generation whole genome RH map of the river buffalo with comparison to domestic cattle , 2008, BMC Genomics.

[20]  P. Buneman.  A Note on the Metric Properties of Trees , 1974 .

[21]  Tandy J. Warnow,et al.  A Few Logs Suffice to Build (almost) All Trees: Part II , 1999, Theor. Comput. Sci..

[22]  GusfieldDan.  Introduction to the IEEE/ACM Transactions on Computational Biology and Bioinformatics , 2004 .

[23]  Gang Wu,et al.  A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem , 2005, WABI.

[24]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[25]  Sébastien Roch,et al.  A short proof that phylogenetic tree reconstruction by maximum likelihood is hard , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[26]  R. Graham,et al.  The steiner problem in phylogeny is NP-complete , 1982 .

[27]  T. Yato,et al.  Complexity and Completeness of Finding Another Solution and Its Application to Puzzles , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[28]  Charles Semple,et al.  A characterization for a set of partial partitions to define an X-tree , 2002, Discret. Math..

[29]  Daniel H. Huson,et al.  Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction , 1999, J. Comput. Biol..

[30]  Gérard Guérin,et al.  The first-generation whole-genome radiation hybrid map in the horse identifies conserved segments in human and mouse genomes. , 2003, Genome research.

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