Quartets and Unrooted phylogenetic Networks

Phylogenetic networks were introduced to describe evolution in the presence of exchanges of genetic material between coexisting species or individuals. Split networks in particular were introduced as a special kind of abstract network to visualize conflicts between phylogenetic trees which may correspond to such exchanges. More recently, methods were designed to reconstruct explicit phylogenetic networks (whose vertices can be interpreted as biological events) from triplet data. In this article, we link abstract and explicit networks through their combinatorial properties, by introducing the unrooted analog of level-k networks. In particular, we give an equivalence theorem between circular split systems and unrooted level-1 networks. We also show how to adapt to quartets some existing results on triplets, in order to reconstruct unrooted level-k phylogenetic networks. These results give an interesting perspective on the combinatorics of phylogenetic networks and also raise algorithmic and combinatorial questions.

[1]  Tobias Heinz Kloepper,et al.  Algorithms for the Calculation and Visualisation of Phylogenetic Networks , 2008 .

[2]  Andy Purvis,et al.  Getting to the roots of matrix representation. , 2005, Systematic biology.

[3]  Daniel H. Huson,et al.  Constructing splits graphs , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[4]  Daniel H Huson,et al.  Filtered Z-closure supernetworks for extracting and visualizing recurrent signal from incongruent gene trees. , 2008, Systematic biology.

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

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

[7]  Stefan Grünewald,et al.  Consistency of the QNet algorithm for generating planar split networks from weighted quartets , 2009, Discret. Appl. Math..

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

[9]  Frédéric Delsuc,et al.  Visualizing conflicting evolutionary hypotheses in large collections of trees: using consensus networks to study the origins of placentals and hexapods. , 2005, Systematic biology.

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

[11]  Salvador Capella-Gutiérrez,et al.  PhylomeDB v3.0: an expanding repository of genome-wide collections of trees, alignments and phylogeny-based orthology and paralogy predictions , 2010, Nucleic Acids Res..

[12]  L. Stougie,et al.  Constructing Level-2 Phylogenetic Networks from Triplets , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[13]  Christophe Paul,et al.  The Structure of Level-k Phylogenetic Networks , 2009, CPM.

[14]  Wing-Kin Sung,et al.  Algorithms for combining rooted triplets into a galled phylogenetic network , 2005, SODA '05.

[15]  K. Crandall,et al.  A Comparison of Phylogenetic Network Methods Using Computer Simulation , 2008, PloS one.

[16]  Philippe Gambette,et al.  On encodings of phylogenetic networks of bounded level , 2009, Journal of mathematical biology.

[17]  D. Morrison,et al.  Networks in phylogenetic analysis: new tools for population biology. , 2005, International journal for parasitology.

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

[19]  Stefan Grünewald,et al.  Constructing Phylogenetic Supernetworks from Quartets , 2008, WABI.

[20]  Leo van Iersel,et al.  Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks , 2007, J. Bioinform. Comput. Biol..

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

[22]  P. Buneman.  The Recovery of Trees from Measures of Dissimilarity , 1971 .

[23]  Vladimir Makarenkov,et al.  T-REX: reconstructing and visualizing phylogenetic trees and reticulation networks , 2001, Bioinform..

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

[25]  Kristoffer Forslund,et al.  QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets. , 2006, Molecular biology and evolution.

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

[27]  Wing-Kin Sung,et al.  Inferring phylogenetic relationships avoiding forbidden rooted triplets , 2006, APBC.

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

[29]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[30]  Torsten Tholey.  Improved Algorithms for the 2-Vertex Disjoint Paths Problem , 2009, SOFSEM.

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

[32]  Ulrik Brandes,et al.  Phylogenetic graph models beyond trees , 2009, Discret. Appl. Math..

[33]  Daniel H. Huson,et al.  Reconstruction of Reticulate Networks from Gene Trees , 2005, RECOMB.

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

[35]  Guy Perrière,et al.  Tree pattern matching in phylogenetic trees: automatic search for orthologs or paralogs in homologous gene sequence databases , 2005, Bioinform..

[36]  Vincent Moulton,et al.  Using supernetworks to distinguish hybridization from lineage-sorting , 2008, BMC Evolutionary Biology.

[37]  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..

[38]  Leo van Iersel,et al.  On the Elusiveness of Clusters , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.