Constructing a Minimum phylogenetic Network from a Dense triplet Set

For a given set L of species and a set T of triplets on L, we seek to construct a phylogenetic network which is consistent with T i.e. which represents all triplets of T. The level of a network is defined as the maximum number of hybrid vertices in its biconnected components. When T is dense, there exist polynomial time algorithms to construct level-0,1 and 2 networks (Aho et al., 1981; Jansson, Nguyen and Sung, 2006; Jansson and Sung, 2006; Iersel et al., 2009). For higher levels, partial answers were obtained in the paper by Iersel and Kelk (2008), with a polynomial time algorithm for simple networks. In this paper, we detail the first complete answer for the general case, solving a problem proposed in Jansson and Sung (2006) and Iersel et al. (2009). For any k fixed, it is possible to construct a level-k network having the minimum number of hybrid vertices and consistent with T, if there is any, in time O(T(k+1)n([4k/3]+1)).

[1]  Kunihiko Sadakane,et al.  Computing the Maximum Agreement of Phylogenetic Networks , 2004, CATS.

[2]  D. Posada,et al.  Characterization of Reticulate Networks Based on the Coalescent with Recombination , 2008, Molecular biology and evolution.

[3]  Tandy J. Warnow,et al.  Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology , 1996, SODA '96.

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

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

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

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

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

[9]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[10]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[11]  Andrzej Lingas,et al.  Inferring Ordered Trees from Local Constraints , 1998, CATS.

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

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

[14]  Steven Kelk,et al.  When two trees go to war. , 2010, Journal of theoretical biology.

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

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

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

[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.  Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks , 2007, J. Bioinform. Comput. Biol..