When two trees go to war.

Rooted phylogenetic networks are used to model non-treelike evolutionary histories. Such networks are often constructed by combining trees, clusters, triplets or characters into a single network that in some well-defined sense simultaneously represents them all. We review these four models and investigate how they are related. Motivated by the parsimony principle, one often aims to construct a network that contains as few reticulations (non-treelike evolutionary events) as possible. In general, the model chosen influences the minimum number of reticulation events required. However, when one obtains the input data from two binary (i.e. fully resolved) trees, we show that the minimum number of reticulations is independent of the model. The number of reticulations necessary to represent the trees, triplets, clusters (in the softwired sense) and characters (with unrestricted multiple crossover recombination) are all equal. Furthermore, we show that these results also hold when not the number of reticulations but the level of the constructed network is minimised. We use these unification results to settle several computational complexity questions that have been open in the field for some time. We also give explicit examples to show that already for data obtained from three binary trees the models begin to diverge.

[1]  Wing-Kin Sung,et al.  Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets , 2004, COCOON.

[2]  L. Nakhleh.  Evolutionary Phylogenetic Networks: Models and Issues , 2010 .

[3]  Leo van Iersel,et al.  Constructing the Simplest Possible Phylogenetic Network from Triplets , 2008, Algorithmica.

[4]  Ge Xia,et al.  Seeing the trees and their branches in the network is hard , 2007, Theor. Comput. Sci..

[5]  Yun S. Song,et al.  A Decomposition Theory for Phylogenetic Networks and Incompatible Characters , 2007, J. Comput. Biol..

[6]  Steven Kelk,et al.  CASS: Combining phylogenetic trees into a phylogenetic network , 2009 .

[7]  Daniel H. Huson,et al.  Dendroscope: An interactive viewer for large phylogenetic trees , 2007, BMC Bioinformatics.

[8]  Wing-Kin Sung,et al.  Constructing a Smallest Refining Galled Phylogenetic Network , 2005, RECOMB.

[9]  Cynthia A. Phillips,et al.  The Asymmetric Median Tree - A New Model for Building Consensus Trees , 1996, Discret. Appl. Math..

[10]  Charles Semple,et al.  Optimizing phylogenetic diversity across two trees , 2009, Appl. Math. Lett..

[11]  Charles Semple,et al.  Computing the minimum number of hybridization events for a consistent evolutionary history , 2007, Discret. Appl. Math..

[12]  Leo van Iersel,et al.  Constructing Level-2 Phylogenetic Networks from Triplets , 2008, RECOMB.

[13]  Dan Gusfield,et al.  An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study , 2007, Discret. Appl. Math..

[14]  Daniel H. Huson,et al.  Beyond Galled Trees - Decomposition and Computation of Galled Networks , 2007, RECOMB.

[15]  Luay Nakhleh,et al.  Phylogenetic networks , 2004 .

[16]  Steven Kelk,et al.  Constructing level-2 phylogenetic networks from rooted triplets , 2008, RECOMB 2008.

[17]  Daniel H. Huson,et al.  Summarizing Multiple Gene Trees Using Cluster Networks , 2008, WABI.

[18]  Simone Linz,et al.  Hybridization in Non-Binary Trees , 2008 .

[19]  Michel Habib,et al.  Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time , 2009, CPM.

[20]  Yun S. Song,et al.  Minimum Recombination Histories by Branch and Bound , 2005, WABI.

[21]  Yufeng Wu,et al.  Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees , 2010, Bioinform..

[22]  Daniel H. Huson,et al.  Computing galled networks from real data , 2009, Bioinform..

[23]  Olivier Gascuel,et al.  Reconstructing evolution : new mathematical and computational advances , 2007 .

[24]  C. Semple,et al.  Hybridization in Nonbinary Trees , 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[25]  V. Moulton,et al.  Bounding the Number of Hybridisation Events for a Consistent Evolutionary History , 2005, Journal of mathematical biology.

[26]  Naren Ramakrishnan,et al.  Problem Solving Handbook in Computational Biology and Bioinformatics , 2010 .

[27]  R. Griffiths,et al.  Bounds on the minimum number of recombination events in a sample history. , 2003, Genetics.

[28]  Kaizhong Zhang,et al.  Perfect Phylogenetic Networks with Recombination , 2001, J. Comput. Biol..

[29]  Yun S. Song,et al.  Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution , 2005, ISMB.

[30]  Wing-Kin Sung,et al.  Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network , 2006, SIAM J. Comput..

[31]  Jiayin Wang,et al.  Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees , 2010, ISBRA.

[32]  Simone Linz,et al.  Quantifying Hybridization in Realistic Time , 2011, J. Comput. Biol..

[33]  M. Bordewich,et al.  Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[34]  Leo van Iersel,et al.  Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters , 2009, Bioinform..

[35]  Simone Linz,et al.  A Reduction Algorithm for Computing The Hybridization Number of Two Trees , 2007, Evolutionary bioinformatics online.

[36]  Dan Gusfield,et al.  A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem , 2007, COCOON.

[37]  Dan Gusfield,et al.  Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination , 2004, J. Bioinform. Comput. Biol..

[38]  Charles Semple,et al.  Hybrids in real time. , 2006, Systematic biology.

[39]  Yun S. Song,et al.  Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations , 2006, RECOMB.