当两棵树开战时
When two trees go to war
摘要:
有根系统发育网络通常是通过将树、簇、三联体或特征组合成一个单一的网络来构建的,在某种定义明确的意义上,这个网络同时代表了所有这些。我们回顾这四种模式,并探讨它们是如何相关的。一般来说,所选的模型会影响所需的最小网状化事件数量。然而,当从两个二叉树获得输入数据时,我们证明了最小网格数与模型无关。表示树、三联体、簇(在软件意义上)和字符(具有不受限制的多重交叉重组)所需的网格数都是相等的。此外,我们表明,这些结果也持有时,而不是网状的数量,但所构建的网络的水平最小化。我们使用这些统一的结果来解决一些复杂的问题,已经在该领域开放了一段时间。我们还给出了明确的例子表明,已经从三个二叉树的模型开始发散的数据。
英文摘要:
Rooted phylogenetic networks are often constructed by combining trees, clusters, triplets or characters into a single network that in some well-defined sense simultaneously represents them all. We review these four models and investigate how they are related. In general, the model chosen influences the minimum number of reticulation events required. However, when one obtains the input data from two binary trees, we show that the minimum number of reticulations is independent of the model. The number of reticulations necessary to represent the trees, triplets, clusters (in the softwired sense) and characters (with unrestricted multiple crossover recombination) are all equal. Furthermore, we show that these results also hold when not the number of reticulations but the level of the constructed network is minimised. We use these unification results to settle several complexity questions that have been open in the field for some time. We also give explicit examples to show that already for data obtained from three binary trees the models begin to diverge.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。