• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用最大简约法重建系统发育网络。

Reconstructing phylogenetic networks using maximum parsimony.

作者信息

Nakhleh Luay, Jin Guohua, Zhao Fengmei, Mellor-Crummey John

机构信息

Department of Computer Science, Rice University, Houston, TX 77005, USA.

出版信息

Proc IEEE Comput Syst Bioinform Conf. 2005:93-102. doi: 10.1109/csb.2005.47.

DOI:10.1109/csb.2005.47
PMID:16447967
Abstract

Phylogenies - the evolutionary histories of groups of organisms - are one of the most widely used tools throughout the life sciences, as well as objects of research within systematics, evolutionary biology, epidemiology, etc. Almost every tool devised to date to reconstruct phylogenies produces trees; yet it is widely understood and accepted that trees oversimplify the evolutionary histories of many groups of organims, most prominently bacteria (because of horizontal gene transfer) and plants (because of hybrid speciation). Various methods and criteria have been introduced for phylogenetic tree reconstruction. Parsimony is one of the most widely used and studied criteria, and various accurate and efficient heuristics for reconstructing trees based on parsimony have been devised. Jotun Hein suggested a straightforward extension of the parsimony criterion to phylogenetic networks. In this paper we formalize this concept, and provide the first experimental study of the quality of parsimony as a criterion for constructing and evaluating phylogenetic networks. Our results show that, when extended to phylogenetic networks, the parsimony criterion produces promising results. In a great majority of the cases in our experiments, the parsimony criterion accurately predicts the numbers and placements of non-tree events.

摘要

系统发育树——生物群体的进化历史——是整个生命科学中使用最广泛的工具之一,也是系统学、进化生物学、流行病学等领域的研究对象。迄今为止,几乎所有用于重建系统发育树的工具都会生成树状图;然而,人们普遍理解并接受的是,树状图过度简化了许多生物群体的进化历史,最显著的是细菌(由于水平基因转移)和植物(由于杂交物种形成)。已经引入了各种方法和标准来重建系统发育树。简约性是使用最广泛且研究最多的标准之一,并且已经设计出了各种基于简约性来重建树的准确而有效的启发式方法。约通·海因提出了将简约性标准直接扩展到系统发育网络的方法。在本文中,我们将这一概念形式化,并首次对简约性作为构建和评估系统发育网络的标准的质量进行了实验研究。我们的结果表明,当扩展到系统发育网络时,简约性标准产生了令人满意的结果。在我们实验中的绝大多数情况下,简约性标准准确地预测了非树状事件的数量和位置。

相似文献

1
Reconstructing phylogenetic networks using maximum parsimony.使用最大简约法重建系统发育网络。
Proc IEEE Comput Syst Bioinform Conf. 2005:93-102. doi: 10.1109/csb.2005.47.
2
Efficient parsimony-based methods for phylogenetic network reconstruction.基于简约法的高效系统发育网络重建方法。
Bioinformatics. 2007 Jan 15;23(2):e123-8. doi: 10.1093/bioinformatics/btl313.
3
Inferring phylogenetic networks by the maximum parsimony criterion: a case study.基于最大简约标准推断系统发育网络:一个案例研究。
Mol Biol Evol. 2007 Jan;24(1):324-37. doi: 10.1093/molbev/msl163. Epub 2006 Oct 26.
4
Parsimony score of phylogenetic networks: hardness results and a linear-time heuristic.系统发育网络的简约得分:硬度结果与线性时间启发式算法
IEEE/ACM Trans Comput Biol Bioinform. 2009 Jul-Sep;6(3):495-505. doi: 10.1109/TCBB.2008.119.
5
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.DupTree:一个使用基因树简约法进行大规模系统发育分析的程序。
Bioinformatics. 2008 Jul 1;24(13):1540-1. doi: 10.1093/bioinformatics/btn230. Epub 2008 May 12.
6
PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships.PhyloNet:一个用于分析和重建网状进化关系的软件包。
BMC Bioinformatics. 2008 Jul 28;9:322. doi: 10.1186/1471-2105-9-322.
7
On the quirks of maximum parsimony and likelihood on phylogenetic networks.关于系统发育网络上最大简约法和似然法的奇特之处。
J Theor Biol. 2017 Mar 21;417:100-108. doi: 10.1016/j.jtbi.2017.01.013. Epub 2017 Jan 11.
8
Maximum likelihood of phylogenetic networks.系统发育网络的最大似然法
Bioinformatics. 2006 Nov 1;22(21):2604-11. doi: 10.1093/bioinformatics/btl452. Epub 2006 Aug 23.
9
Reconstructing recombination network from sequence data: the small parsimony problem.从序列数据重建重组网络:小简约问题。
IEEE/ACM Trans Comput Biol Bioinform. 2007 Jul-Sep;4(3):394-402. doi: 10.1109/tcbb.2007.1018.
10
Mixed integer linear programming for maximum-parsimony phylogeny inference.用于最大简约系统发育推断的混合整数线性规划。
IEEE/ACM Trans Comput Biol Bioinform. 2008 Jul-Sep;5(3):323-31. doi: 10.1109/TCBB.2008.26.

引用本文的文献

1
The tree labeling polytope: a unified approach to ancestral reconstruction problems.树标记多面体:祖先重建问题的统一方法。
bioRxiv. 2025 Feb 19:2025.02.14.638328. doi: 10.1101/2025.02.14.638328.
2
Bounding the Softwired Parsimony Score of a Phylogenetic Network.对系统发生网络的软布线简约得分进行限定。
Bull Math Biol. 2024 Aug 22;86(10):121. doi: 10.1007/s11538-024-01350-9.
3
A complete theoretical framework for inferring horizontal gene transfers using partial order sets.使用偏序集推断水平基因转移的完整理论框架。
PLoS One. 2023 Mar 24;18(3):e0281824. doi: 10.1371/journal.pone.0281824. eCollection 2023.
4
Treewidth-based algorithms for the small parsimony problem on networks.基于树宽的网络上小简约问题的算法
Algorithms Mol Biol. 2022 Aug 20;17(1):15. doi: 10.1186/s13015-022-00216-w.
5
NetRAX: accurate and fast maximum likelihood phylogenetic network inference.NetRAX:准确快速的最大似然系统发育网络推断。
Bioinformatics. 2022 Aug 2;38(15):3725-3733. doi: 10.1093/bioinformatics/btac396.
6
Finding a most parsimonious or likely tree in a network with respect to an alignment.在一个网络中,相对于一个比对结果找到一棵最简约或最可能的树。
J Math Biol. 2019 Jan;78(1-2):527-547. doi: 10.1007/s00285-018-1282-2. Epub 2018 Aug 19.
7
Diverse and Abundant Secondary Metabolism Biosynthetic Gene Clusters in the Genomes of Marine Sponge Derived Streptomyces spp. Isolates.海洋海绵来源的链霉菌属分离物基因组中的多样且丰富的次级代谢生物合成基因簇。
Mar Drugs. 2018 Feb 20;16(2):67. doi: 10.3390/md16020067.
8
In the light of deep coalescence: revisiting trees within networks.鉴于深度合并:重新审视网络中的树
BMC Bioinformatics. 2016 Nov 11;17(Suppl 14):415. doi: 10.1186/s12859-016-1269-1.
9
Network Analysis of Sequence-Function Relationships and Exploration of Sequence Space of TEM β-Lactamases.TEM β-内酰胺酶序列-功能关系的网络分析及序列空间探索
Antimicrob Agents Chemother. 2016 Apr 22;60(5):2709-17. doi: 10.1128/AAC.02930-15. Print 2016 May.
10
Phylogenetic network analysis as a parsimony optimization problem.作为简约优化问题的系统发育网络分析
BMC Bioinformatics. 2015 Sep 17;16:296. doi: 10.1186/s12859-015-0675-0.