Constructing Level-2 Phylogenetic Networks from Triplets

Jansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of taxa), it is possible to determine in polynomial time whether there exists a level-1 network consistent with T , and if so to construct such a network [18]. Here we extend this work by showing that this problem is even polynomial-time solvable for the construction of level-2 networks. This shows that, assuming density, it is tractable to construct plausible evolutionary histories from input triplets even when such histories are heavily non-tree like. This further strengthens the case for the use of triplet-based methods in the construction of phylogenetic networks. We also implemented the algorithm and applied it to yeast data.

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

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

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

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

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

[6]  O. Gascuel,et al.  A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. , 2003, Systematic biology.

[7]  M. Holder,et al.  Phylogeny estimation: traditional and Bayesian approaches , 2003, Nature Reviews Genetics.

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

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

[10]  Andrzej Lingas,et al.  On the Complexity of Constructing Evolutionary Trees , 1999, J. Comb. Optim..

[11]  D. Huson,et al.  Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.

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

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

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

[15]  Tandy J. Warnow,et al.  Phylogenetic networks: modeling, reconstructibility, and accuracy , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

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

[17]  Siu-Ming Yiu,et al.  Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix , 2006, J. Bioinform. Comput. Biol..

[18]  T. Boekhout,et al.  A rare genotype of Cryptococcus gattii caused the cryptococcosis outbreak on Vancouver Island (British Columbia, Canada). , 2004, Proceedings of the National Academy of Sciences of the United States of America.

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

[20]  Kunihiko Sadakane,et al.  Rooted Maximum Agreement Supertrees , 2004, LATIN.

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

[22]  Vladimir Makarenkov,et al.  Phylogenetic Network Construction Approaches , 2006 .

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