论文标题
Trinets编码果园的系统发育网络
Trinets encode orchard phylogenetic networks
论文作者
论文摘要
生根的三元组，三片叶子上的二元系统发育树，足以编码生根的二元系统发育树。也就是说，如果$ \ MATHCAL T $和$ \ MATHCAL T'$是根生根的二进制系统发育$ x $ -Trees，它会输入相同的植根三元组，然后$ \ MATHCAL T $和$ \ MATHCAL T'$是同构的。但是，通常，这种充分性不会扩展到根生根的系统发育网络。在本文中，我们表明，植根三元组的系统发育网络类似物足以编码生根的二元果园网络。生根的二进制果园网络自然概括了扎根的二进制树木孩子网络。此外，我们提出了一种多项式时间算法，用于从其一组Trinets构建生根的二进制果园网络。结果，该算法肯定地回答了一个以前提出的问题，即是否有一种多项式时间算法，用于从IT IT IT IT In Inders的一组Trinets构建生根的二进制二元树木网络。
Rooted triples, rooted binary phylogenetic trees on three leaves, are sufficient to encode rooted binary phylogenetic trees. That is, if $\mathcal T$ and $\mathcal T'$ are rooted binary phylogenetic $X$-trees that infers the same set of rooted triples, then $\mathcal T$ and $\mathcal T'$ are isomorphic. However, in general, this sufficiency does not extend to rooted binary phylogenetic networks. In this paper, we show that trinets, phylogenetic network analogues of rooted triples, are sufficient to encode rooted binary orchard networks. Rooted binary orchard networks naturally generalise rooted binary tree-child networks. Moreover, we present a polynomial-time algorithm for building a rooted binary orchard network from its set of trinets. As a consequence, this algorithm affirmatively answers a previously-posed question of whether there is a polynomial-time algorithm for building a rooted binary tree-child network from the set of trinets it infers.
