Combining Networks using Cherry Picking Sequences

TL;DR

This paper introduces an FPT algorithm for the Tree-child Network Hybridization problem, enabling the combination of small phylogenetic networks into larger ones with low complexity, advancing methods for reconstructing larger evolutionary networks.

Contribution

It characterizes the complexity of network combination via a restricted problem and provides an efficient fixed-parameter tractable algorithm for it.

Findings

Developed an FPT algorithm for Tree-child Network Hybridization.

Characterized the complexity of combining phylogenetic networks.

Enables reconstruction of larger networks from smaller components.

Abstract

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 {\sc Network Hybridization} problem, a problem of combining networks into another network with low complexity. We characterize this complexity via a restricted problem, {\sc Tree-child Network Hybridization}, and we present an FPT algorithm to efficiently solve this restricted problem.