Print Email Facebook Twitter Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks Title Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks Author Murakami, Yukihiro (TU Delft Discrete Mathematics and Optimization) van Iersel, L.J.J. (TU Delft Discrete Mathematics and Optimization) Janssen, R. (TU Delft Discrete Mathematics and Optimization) Jones, M.E.L. (TU Delft Discrete Mathematics and Optimization) Moulton, V.L. (University of East Anglia) Date 2019 Abstract 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. Subject Network encodingPhylogenetic networkReticulate-edge-deleted subnetworksTree-child networks To reference this document use: http://resolver.tudelft.nl/uuid:126282aa-8296-4fd7-92b4-a2ee0f00badb DOI https://doi.org/10.1007/s11538-019-00641-w ISSN 0092-8240 Source Bulletin of Mathematical Biology, 81 (10), 3823-3863 Bibliographical note green Part of collection Institutional Repository Document type journal article Rights © 2019 Yukihiro Murakami, L.J.J. van Iersel, R. Janssen, M.E.L. Jones, V.L. Moulton Files PDF Murakami2019_Article_Reco ... Networ.pdf 1.44 MB Close viewer /islandora/object/uuid:126282aa-8296-4fd7-92b4-a2ee0f00badb/datastream/OBJ/view