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.
CITATION STYLE
Janssen, R., Jones, M., & Murakami, Y. (2020). Combining Networks Using Cherry Picking Sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12099 LNBI, pp. 77–92). Springer. https://doi.org/10.1007/978-3-030-42266-0_7
Mendeley helps you to discover research relevant for your work.