论文标题
在颞树的网络中弱展示树木
Weakly displaying trees in temporal tree-child network
论文作者
论文摘要
最近，人们对找到具有最少数量的网状网络的系统发育网络引起了极大的兴趣，该网络显示了一组给定的系统发育树，即具有最低杂种数量的网络。即便如此，对于某些进化场景，坚持认为网络显示树集可能是一个过于限制的假设。在本文中，我们考虑了显示弱显示的限制性概念，特别是我们称为严格显示的特殊情况。我们表征了何时可以通过颞叶的序列序列来严格地展示两棵树，这一概念与樱桃采摘序列密切相关。我们还表明，如果存在，则两种系统发育树的刚性混合数是由树木的最小重量叉序列序列给出的，并且刚性混合数可能与相关的串珠和颞杂交杂交数字大不相同。
Recently there has been considerable interest in the problem of finding a phylogenetic network with a minimum number of reticulation vertices which displays a given set of phylogenetic trees, that is, a network with minimum hybrid number. Even so, for certain evolutionary scenarios insisting that a network displays the set of trees can be an overly restrictive assumption. In this paper, we consider the less restrictive notion of displaying called weakly displaying and, in particular, a special case of this which we call rigidly displaying. We characterize when two trees can be rigidly displayed by a temporal tree-child network in terms of fork-picking sequences, a concept that is closely related to that of cherry-picking sequences. We also show that, in case it exists, the rigid hybrid number for two phylogenetic trees is given by a minimum weight fork-picking sequence for the trees, and that the rigid hybrid number can be quite different from the related beaded- and temporal-hybrid numbers.
