论文标题
可以同时在养树网络中显示多个系统发育树吗？
Can Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?
论文作者
论文摘要
分类群上的二进制系统发育网络$ x $是一个根生的环形挖掘图，其中每个非叶子节点的程度为三个，其叶子（即，叶子一级节点）被唯一标记为$ x $。如果每个非叶子节点至少有一个indegree的孩子，那就是树孩子。一组二元系统发育树可能会同时显示在二进制树木网络中。此处给出了在养树网络中同时显示多个系统发育树的必要条件。特别是，证明任何两种系统发育树总是可以同时显示在同一分类单元中的某些树木网络中。还可以证明，任何一组多个二元系统发育树总是可以同时显示在同一分类群上的某些非二进制树木网络中，其中每个非叶子节点均为indegree One and Indegree and Indegree，或者至少是两个且超过两个。
A binary phylogenetic network on a taxon set $X$ is a rooted acyclic digraph in which the degree of each nonleaf node is three and its leaves (i.e.degree-one nodes) are uniquely labeled with the taxa of $X$. It is tree-child if each nonleaf node has at least one child of indegree one. A set of binary phylogenetic trees may or may not be simultaneously displayed in a binary tree-child network. Necessary conditions for multiple phylogenetic trees being simultaneously displayed in a tree-child network are given here. In particular, it is proved that any two phylogenetic trees can always simultaneously be displayed in some tree-child network on the same taxa set. It is also proved that any set of multiple binary phylogenetic trees can always simultaneously be displayed in some non-binary tree-child network on the same taxa set, where each nonleaf node is of either indegree one and outdegree two or indegree at least two and outdegree out.
