Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable

Reticulation processes in evolution mean that the ancestral history of certain groups of present-day species is non-tree-like. These processes include hybridization, lateral gene transfer, and recombination. Despite the existence of reticulation, such events are relatively rare and, so, a fundamental problem for biologists is the following: Given a collection of rooted binary phylogenetic trees on sets of species that correctly represent the tree-like evolution of different parts of their genomes, what is the smallest number of "reticulation" vertices in any network that explains the evolution of the species under consideration? It has been previously shown that this problem is NP-hard even when the collection consists of only two rooted binary phylogenetic trees. However, in this paper, we show that the problem is fixed-parameter tractable in the two-tree instance when parameterized by this smallest number of reticulation vertices.

[1]  J. Hein.  Reconstructing evolution of sequences subject to recombination using parsimony. , 1990, Mathematical biosciences.

[2]  Tao Jiang,et al.  On the Complexity of Comparing Evolutionary Trees , 1996, Discret. Appl. Math..

[3]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[4]  Bin Ma,et al.  From Gene Trees to Species Trees , 2000, SIAM J. Comput..

[5]  M. Steel,et al.  Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees , 2001 .

[6]  Kaizhong Zhang,et al.  Perfect phylogenetic networks with recombination , 2001, J. Comput. Biol..

[7]  Michael T. Hallett,et al.  Efficient algorithms for lateral gene transfer problems , 2001, RECOMB.

[8]  Yoshiko Wakabayashi,et al.  Some Approximation Results for the Maximum Agreement Forest Problem , 2001, RANDOM-APPROX.

[9]  Yun S. Song,et al.  Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks , 2003, WABI.

[10]  Tandy J. Warnow,et al.  Reconstructing reticulate evolution in species: theory and practice , 2004, RECOMB.

[11]  J. Hein.  A heuristic method to reconstruct the history of sequences subject to recombination , 1993, Journal of Molecular Evolution.

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

[13]  Charles Semple,et al.  On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance , 2005 .

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

[15]  Dan Gusfield,et al.  A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters , 2005, RECOMB.

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

[17]  Maria Luisa Bonet,et al.  Approximating Subtree Distances Between Phylogenies , 2006, J. Comput. Biol..

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