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.

Additional Metadata
Keywords FPT algorithms, Network hybridization, Phylogenetic networks, Tree-child networks
Persistent URL dx.doi.org/10.1007/978-3-030-42266-0_7
Series Lecture Notes in Computer Science
Conference International Conference on Algorithms for Computational Biology
Citation
Janssen, R, Jones, M.E.L, & Murakami, Y. (2020). Combining Networks Using Cherry Picking Sequences. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 77–92). doi:10.1007/978-3-030-42266-0_7