Network reconstruction lies at the heart of phylogenetic research. Two well-studied classes of phylogenetic networks include tree-child networks and level-k networks. In a tree-child network, every non-leaf node has a child that is a tree node or a leaf. In a level-k network, the maximum number of reticulations contained in a biconnected component is k. Here, we show that level-k tree-child networks are encoded by their reticulate-edge-deleted subnetworks, which are subnetworks obtained by deleting a single reticulation edge, if k>=2. Following this, we provide a polynomial-time algorithm for uniquely reconstructing such networks from their reticulate-edge-deleted subnetworks. Moreover, we show that this can even be done when considering subnetworks obtained by deleting one reticulation edge from each biconnected component with k reticulations.

Additional Metadata
Keywords Phylogenetic network, Network encoding, Tree-child networks, Reticulate-edge-deleted subnetworks
Persistent URL dx.doi.org/10.1007/s11538-019-00641-w
Journal Bulletin of Mathematical Biology
Citation
Murakami, Y, van Iersel, L.J.J, Janssen, R, Jones, M.E.L, & Moulton, V. (2019). Reconstructing tree-child networks from reticulate-edge-deleted subnetworks. Bulletin of Mathematical Biology, 81, 3823–3863. doi:10.1007/s11538-019-00641-w