一种由trunk重构二级系统发生网络的算法
An algorithm for reconstructing level-2 phylogenetic networks from trinets
摘要:
物种之间相互杂交或交换遗传物质的进化历史可以用叶标记的有向图来表示,称为系统发育网络。在系统发育网络的新兴领域中的一个主要挑战是开发通过将小网络合并成单个大网络来构建此类网络的算法。系统发育网络的层次是衡量其偏离树的一个尺度;网络的层次越高,它变得越不像树。已经开发了用于从小网络构建第1级网络的各种算法。然而,1级网络可能无法捕获某些数据集的复杂性。在本文中,我们提出了一个多项式时间的算法,用于从一组3叶网络或树中构造一个有根的二进制2级系统发育网络。此外,我们证明了该算法将正确地重建这样的网络,如果它是给定的网络中的所有trunk作为输入。该算法在时间上运行$O(t\cdot n+n^4)$,其中$t$是输入树的数目,$n$是叶的数目。我们还表明,有一个根本性的障碍,从traditional构建3级网络,因此需要开发新的方法来构建3级和更高级别的网络。
英文摘要:
Evolutionary histories for species that cross with one another or exchange genetic material can be represented by leaf-labelled, directed graphs called phylogenetic networks. A major challenge in the burgeoning area of phylogenetic networks is to develop algorithms for building such networks by amalgamating small networks into a single large network. The level of a phylogenetic network is a measure of its deviation from being a tree; the higher the level of network, the less treelike it becomes. Various algorithms have been developed for building level-1 networks from small networks. However, level-1 networks may not be able to capture the complexity of some data sets. In this paper, we present a polynomial-time algorithm for constructing a rooted binary level-2 phylogenetic network from a collection of 3-leaf networks or trinets. Moreover, we prove that the algorithm will correctly reconstruct such a network if it is given all of the trinets in the network as input. The algorithm runs in time $O(t\cdot n+n^4)$ with $t$ the number of input trinets and $n$ the number of leaves. We also show that there is a fundamental obstruction to constructing level-3 networks from trinets, and so new approaches will need to be developed for constructing level-3 and higher level-networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。