Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees

A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Pi of the symmetric group S_3. An instance of such a problem consists of a set of variables V and a set of constraints C, where each constraint is an ordered triple of distinct elements from V. The goal is to construct a linear order alpha on V such that, for each constraint (a,b,c) in C, the ordering of a,b,c induced by alpha is in Pi. Excluding symmetries and trivial cases there are 11 such problems, and their complexity is well known. Here we consider the variant of the problem, denoted 2-Pi, where we are allowed to construct two linear orders alpha and beta and each constraint needs to be satisfied by at least one of the two. We give a full complexity classification of all 11 2-Pi problems, observing that in the switch from one to two linear orders the complexity landscape changes quite abruptly and that hardness proofs become rather intricate. We then focus on one of the 11 problems in particular, which is closely related to the '2-Caterpillar Compatibility' problem in the phylogenetics literature. We show that this particular CSP remains hard on three linear orders, and also in the biologically relevant case when we swap three linear orders for three phylogenetic trees, yielding the '3-Tree Compatibility' problem. Due to the biological relevance of this problem we also give extremal results concerning the minimum number of trees required, in the worst case, to satisfy a set of rooted triplet constraints on n leaf labels.

[1]  Matthias Mnich,et al.  Kernel and fast algorithm for dense triplet inconsistency , 2010, Theor. Comput. Sci..

[2]  Jesper Jansson,et al.  On the Complexity of Inferring Rooted Evolutionary Trees , 2001, Electron. Notes Discret. Math..

[3]  Alfred V. Aho,et al.  Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions , 1981, SIAM J. Comput..

[4]  L. Nakhleh,et al.  Computational approaches to species phylogeny inference and gene tree reconciliation. , 2013, Trends in ecology & evolution.

[5]  Bang Ye Wu,et al.  Constructing the Maximum Consensus Tree from Rooted Triples , 2004, J. Comb. Optim..

[6]  Daniel H. Huson,et al.  Phylogenetic Networks - Concepts, Algorithms and Applications , 2011 .

[7]  Daniel H. Huson,et al.  Phylogenetic Networks: Introduction to phylogenetic networks , 2010 .

[8]  D. Bryant.  Building trees, hunting for trees, and comparing trees : theory and methods in phylogenetic analysis , 1997 .

[9]  Markus Holzer,et al.  The Computational Complexity of the Kakuro Puzzle, Revisited , 2010, FUN.

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2010, JACM.

[12]  Simone Linz,et al.  Optimizing tree and character compatibility across several phylogenetic trees , 2013, Theor. Comput. Sci..

[13]  Victor Neumann-Lara,et al.  The dichromatic number of a digraph , 1982, J. Comb. Theory, Ser. B.

[14]  Frank Ruskey,et al.  Domino Tatami Covering is NP-complete , 2013, IWOCA.

[15]  Prasad Raghavendra,et al.  Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant , 2011, SIAM J. Comput..

[16]  Jaroslaw Byrka,et al.  New Results on Optimizing Rooted Triplets Consistency , 2008, ISAAC.

[17]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[18]  Steven Kelk,et al.  Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks , 2007, J. Discrete Algorithms.

[19]  Leo van Iersel,et al.  Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables , 2012, J. Comput. Syst. Sci..

[20]  László A. Székely,et al.  An improved bound on the maximum agreement subtree problem , 2009, Appl. Math. Lett..

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

[22]  Walter Guttmann,et al.  Variations on an Ordering Theme with Constraints , 2006, IFIP TCS.

[23]  Zvi Galil,et al.  Cyclic Ordering is NP-Complete , 1977, Theor. Comput. Sci..

[24]  Daniel M. Martin,et al.  The maximum agreement subtree problem , 2013, Discret. Appl. Math..

[25]  Bojan Mohar,et al.  The circular chromatic number of a digraph , 2004, J. Graph Theory.