On the Compatibility of Quartet Trees

Phylogenetic tree reconstruction is a fundamental biological problem. Quartet trees, trees over four species, are the minimal informational unit for phylogenetic classification. While every phylogenetic tree over n species defines (n4) quartets, not every set of quartets is compatible with some phylogenetic tree. Here we focus on the compatibility of quartet sets. We provide several results addressing the question of what can be inferred about the compatibility of a set from its subsets. Most of our results use probabilistic arguments to prove the sought characteristics. In particular we show that there are quartet sets Q of size m = cn log n in which every subset of cardinality c'n/log n is compatible, and yet no fraction of more than 1/3 + e of Q is compatible. On the other hand, in contrast to the classical result stating when Q is the densest, i.e. m = (n4) the consistency of any set of 3 quartets implies full consistency, we show that even for m = Θ((n4)) there are (very) inconsistent sets for which every subset of large constant cardinality is consistent. Our final result, relates to the conjecture of Bandelt and Dress regarding the maximum quartet distance between trees. We provide asymptotic upper and lower bounds for this value.

[1]  Mike Steel,et al.  Phylogenetic Closure Operations and Homoplasy-Free Evolution , 2004 .

[2]  Satish Rao,et al.  Quartets MaxCut: A Divide and Conquer Quartets Algorithm , 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[3]  P. Erdös,et al.  A few logs suffice to build (almost) all trees (l): part I , 1997 .

[4]  David Fernández-Baca,et al.  Incompatible quartets, triplets, and characters , 2012, Algorithms for Molecular Biology.

[5]  J. L. Gittleman,et al.  The (Super)Tree of Life: Procedures, Problems, and Prospects , 2002 .

[6]  H. Colonius,et al.  Tree structures for proximity data , 1981 .

[7]  Mike Steel,et al.  Closure operations in phylogenetics. , 2007, Mathematical biosciences.

[8]  D. Robinson,et al.  Comparison of phylogenetic trees , 1981 .

[9]  K. Strimmer,et al.  Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies , 1996 .

[10]  Tao Jiang,et al.  A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application , 2001, SIAM J. Comput..

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

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

[13]  Stefan Grünewald.  Slim sets of binary trees , 2012, J. Comb. Theory, Ser. A.

[14]  Sagi Snir,et al.  Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges , 2012, Random Struct. Algorithms.

[15]  Mike A. Steel,et al.  Constructing Optimal Trees from Quartets , 2001, J. Algorithms.

[16]  Raphael Yuster,et al.  A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs , 2011, SIAM J. Discret. Math..

[17]  M. Csűrös.  Fast recovery of evolutionary trees with thousands of nodes. , 2002, Journal of computational biology : a journal of computational molecular cell biology.

[18]  Maurizio Vichi,et al.  Studies in Classification Data Analysis and knowledge Organization , 2011 .

[19]  O. Bininda-Emonds.  Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life , 2004 .

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

[21]  L. Segal.  John , 2013, The Messianic Secret.

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

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

[24]  Fred R. McMorris,et al.  COMPARISON OF UNDIRECTED PHYLOGENETIC TREES BASED ON SUBTREES OF FOUR EVOLUTIONARY UNITS , 1985 .

[25]  Tandy J. Warnow,et al.  Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining , 2001, SODA '01.

[26]  Raphael Yuster,et al.  Reconstructing approximate phylogenetic trees from quartet samples , 2010, SODA '10.

[27]  David Bryant,et al.  Compatibility of unrooted phylogenetic trees is FPT , 2006, Theor. Comput. Sci..

[28]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[29]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[30]  A. Dress,et al.  Reconstructing the shape of a tree from observed dissimilarity data , 1986 .

[31]  Peter Rossmanith,et al.  A Property Tester for Tree-Likeness of Quartet Topologies , 2011, Theory of Computing Systems.

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

[33]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[34]  A. Cayley.  A theorem on trees , 2009 .

[35]  Elchanan Mossel,et al.  Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep , 2008, SIAM J. Discret. Math..

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

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