生物系统发育网络的基本组成部分
Binets: fundamental building blocks for phylogenetic networks
摘要:
系统发生网络是生物学家用来表示经历了网状进化的生物进化的进化树的概括。从本质上讲,系统发育网络是一个有向无环图,它有一个唯一的根,其中的叶子由一组给定的物种标记。最近,一些方法已经被开发出来,从2-和3-leaved网络,这被称为binets和trademark,分别网络的集合构建系统发育网络。在这里,我们更深入地研究binets集合的属性,binets是系统发育网络可以分解的最简单的网络类型之一。更具体地说,我们表明,如果一个集合的1级binets是兼容的一些二进制网络,那么它也是兼容的二进制1级网络。我们的证明是基于有用的结构的最低稳定的祖先在网络中的结果。此外,我们表明,虽然binets不确定的网络的拓扑结构,他们确定的网络中的网状,这是它的最重要的参数之一的数量。我们还考虑有关binets的算法问题。我们表明,决定是否任意一组binets是兼容的一些网络至少是众所周知的图形同构问题一样难。然而,如果我们仅限于1级binet,则可以在多项式时间内决定是否存在显示所有binet的二进制网络。我们还表明,找到一个网络,显示最大数量的binets是NP-难的,但存在一个简单的多项式时间1/3近似算法这个问题。希望这些结果将最终有助于开发新的方法,用于从较小的网络集合构建系统发育网络。
英文摘要:
Phylogenetic networks are a generalization of evolutionary trees that are used by biologists to represent the evolution of organisms which have undergone reticulate evolution. Essentially, a phylogenetic network is a directed acyclic graph having a unique root in which the leaves are labelled by a given set of species. Recently, some approaches have been developed to construct phylogenetic networks from collections of networks on 2- and 3-leaved networks, which are known as binets and trinets, respectively. Here we study in more depth properties of collections of binets, one of the simplest possible types of networks into which a phylogenetic network can be decomposed. More specifically, we show that if a collection of level-1 binets is compatible with some binary network, then it is also compatible with a binary level-1 network. Our proofs are based on useful structural results concerning lowest stable ancestors in networks. In addition, we show that, although the binets do not determine the topology of the network, they do determine the number of reticulations in the network, which is one of its most important parameters. We also consider algorithmic questions concerning binets. We show that deciding whether an arbitrary set of binets is compatible with some network is at least as hard as the well-known Graph Isomorphism problem. However, if we restrict to level-1 binets, it is possible to decide in polynomial time whether there exists a binary network that displays all the binets. We also show that to find a network that displays a maximum number of the binets is NP-hard, but that there exists a simple polynomial-time 1/3-approximation algorithm for this problem. It is hoped that these results will eventually assist in the development of new methods for constructing phylogenetic networks from collections of smaller networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。