时态树子网络中的弱显示树
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
