期刊
BULLETIN OF MATHEMATICAL BIOLOGY
卷 81, 期 10, 页码 3823-3863出版社
SPRINGER
DOI: 10.1007/s11538-019-00641-w
关键词
Phylogenetic network; Network encoding; Tree-child networks; Reticulate-edge-deleted subnetworks
资金
- Netherlands Organization for Scientific Research (NWO) [639.072.602]
- Netherlands Organization for Scientific Research (NWO) Vidi grant [639.072.602]
- 4TU Applied Mathematics Institute
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据