Cherry Picking: A Characterization of the Temporal Hybridization Number for a Set of Phylogenies

Recently, we have shown that calculating the minimum–temporal-hybridization number for a set ${\mathcal{P}}$ of rooted binary phylogenetic trees is NP-hard and have characterized this minimum number when ${\mathcal{P}}$ consists of exactly two trees. In this paper, we give the first characterization of the problem for ${\mathcal{P}}$ being arbitrarily large. The characterization is in terms of cherries and the existence of a particular type of sequence. Furthermore, in an online appendix to the paper, we show that this new characterization can be used to show that computing the minimum–temporal hybridization number for two trees is fixed-parameter tractable.

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

[2]  Zhi-Zhong Chen,et al.  Algorithms for Reticulate Networks of Multiple Phylogenetic Trees , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

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

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

[5]  Norbert Zeh,et al.  Fixed-Parameter Algorithms for Maximum Agreement Forests , 2011, SIAM J. Comput..

[6]  Zhi-Zhong Chen,et al.  An Ultrafast Tool for Minimum Reticulate Networks , 2013, J. Comput. Biol..

[7]  Ramm,et al.  Fixed-Parameter Algorithms in Phylogenetics , 2007 .

[8]  D. Huson,et al.  A Survey of Combinatorial Methods for Phylogenetic Networks , 2010, Genome biology and evolution.

[9]  Simone Linz,et al.  Analyzing and reconstructing reticulation networks under timing constraints , 2010, Journal of mathematical biology.

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

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

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

[13]  Norbert Zeh,et al.  Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees , 2013, Algorithmica.

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

[15]  Simone Linz,et al.  On the complexity of computing the temporal hybridization number for two phylogenies , 2013, Discret. Appl. Math..

[16]  Rolf Niedermeier,et al.  A fixed-parameter algorithm for minimum quartet inconsistency , 2003, J. Comput. Syst. Sci..

[17]  Steven Kelk,et al.  A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[18]  Gabriel Cardona,et al.  Comparison of Tree-Child Phylogenetic Networks , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

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

[20]  Leo van Iersel,et al.  Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set , 2011, SIAM J. Discret. Math..

[21]  Simone Linz,et al.  A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees , 2011, J. Comput. Biol..