How much information is needed to infer reticulate evolutionary histories?

How much information is needed to infer reticulate evolutionary histories?
复制标题

DOI:
10.1093/sysbio/syu076
复制
发表时间:
2015-01
期刊:
影响因子:
6.5
通讯作者:
Wu T
Wu T
中科院分区:
生物学1区
文献类型:
--
作者:
Huber KT;Van Iersel L;Moulton V;Wu T

文献摘要

参考文献

被引文献

相似文献

系统发生网络是进化树的推广,是分析网状进化历史的重要工具。最近,人们对开发新的方法来构建有根系统发育网络产生了极大的兴趣,即网络的内部顶点对应于假设的祖先,其叶子对应于采样的类群,并且其中具有一个以上亲本的顶点对应于由网状进化事件(如重组或杂交)形成的类群。构建进化树的几种方法使用从更简单的构建块(如三元组或簇)构建树的策略,因此寻找从较小网络构建网络的方法是很自然的。在本文中,我们将展示这种方法的一个基本问题。也就是说,我们表明,即使我们给出了所有的子网络诱导的所有真子集的一些根系统发育网络的叶子,我们仍然没有完全确定该网络所需的所有信息。这意味着,即使将某些网状进化历史的所有构建块作为任何给定网络构建方法的输入,该方法仍然可能输出不正确的历史。我们还讨论了一些潜在的后果,这一结果构建系统发育网络。
Phylogenetic networks are a generalization of evolutionary trees and are an important tool for analyzing reticulate evolutionary histories. Recently, there has been great interest in developing new methods to construct rooted phylogenetic networks, that is, networks whose internal vertices correspond to hypothetical ancestors, whose leaves correspond to sampled taxa, and in which vertices with more than one parent correspond to taxa formed by reticulate evolutionary events such as recombination or hybridization. Several methods for constructing evolutionary trees use the strategy of building up a tree from simpler building blocks (such as triplets or clusters), and so it is natural to look for ways to construct networks from smaller networks. In this article, we shall demonstrate a fundamental issue with this approach. Namely, we show that even if we are given all of the subnetworks induced on all proper subsets of the leaves of some rooted phylogenetic network, we still do not have all of the information required to completely determine that network. This implies that even if all of the building blocks for some reticulate evolutionary history were to be taken as the input for any given network building method, the method might still output an incorrect history. We also discuss some potential consequences of this result for constructing phylogenetic networks.
DOI: 10.1093/molbev/msp309
发表时间: 2010-05-01
影响因子: 10.7
作者:
Morrison, David A.
通讯作者: Morrison, David A.
DOI: 10.1006/mpev.2000.0792
发表时间: 2000-07-01
影响因子: 4.1
作者:
Bandelt, HJ;Macaulay, V;Richards, M
通讯作者: Richards, M
DOI: 10.1007/s00453-012-9659-x
发表时间: 2013-07-01
期刊: ALGORITHMICA
影响因子: 1.1
作者:
Huber, K. T.;Moulton, V.
通讯作者: Moulton, V.
DOI: 10.1007/s004140100228
发表时间: 2001-10-01
影响因子: 2.1
作者:
Bandelt, HJ;Lahermo, P;Macaulay, V
通讯作者: Macaulay, V
DOI: 10.1101/gr.3666505
发表时间: 2005-07-01
期刊: GENOME RESEARCH
影响因子: 7
作者:
Kunin, V;Goldovsky, L;Ouzounis, CA
通讯作者: Ouzounis, CA