Combining Networks Using Cherry Picking Sequences

Phylogenetic networks are important for the study of evolution. The number of methods to find such networks is increasing, but most such methods can only reconstruct small networks. To find bigger networks, one can attempt to combine small networks. In this paper, we study the Network Hybridization problem, a problem of combining networks into another network with low complexity. We characterize this complexity via a restricted problem, Tree-child Network Hybridization, and we present an FPT algorithm to efficiently solve this restricted problem.

[1]  Simone Linz,et al.  Cherry Picking: A Characterization of the Temporal Hybridization Number for a Set of Phylogenies , 2013, Bulletin of Mathematical Biology.

[2]  Charles Semple,et al.  A class of phylogenetic networks reconstructable from ancestral profiles. , 2019, Mathematical biosciences.

[3]  Charles Semple,et al.  Quarnet Inference Rules for Level-1 Networks , 2017, Bulletin of mathematical biology.

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

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

[6]  Simone Linz,et al.  Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies , 2017, Adv. Appl. Math..

[7]  Leo van Iersel,et al.  Binets: Fundamental Building Blocks for Phylogenetic Networks , 2017, Bulletin of mathematical biology.

[8]  Leo van Iersel,et al.  A quadratic kernel for computing the hybridization number of multiple trees , 2012, Inf. Process. Lett..

[9]  Leo van Iersel,et al.  Hybridization Number on Three Rooted Binary Trees is EPT , 2014, SIAM J. Discret. Math..

[10]  Vincent Moulton,et al.  Trinets encode tree-child and level-2 phylogenetic networks , 2014, Journal of mathematical biology.

[11]  Leo van Iersel,et al.  A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees , 2019, Algorithmica.

[12]  Charles Semple,et al.  A Framework for Representing Reticulate Evolution , 2005 .

[13]  Leo van Iersel,et al.  Leaf-Reconstructibility of Phylogenetic Networks , 2017, SIAM J. Discret. Math..

[14]  Vincent Moulton,et al.  TriLoNet: Piecing Together Small Networks to Reconstruct Reticulate Evolutionary Histories. , 2016, Molecular biology and evolution.

[15]  Mark Jones,et al.  Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks , 2018, Bulletin of Mathematical Biology.

[16]  Leo van Iersel,et al.  Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets , 2014, Algorithmica.