• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一项使用SMIDGen比较超树和联合分析方法的模拟研究。

A simulation study comparing supertree and combined analysis methods using SMIDGen.

作者信息

Swenson M Shel, Barbançon François, Warnow Tandy, Linder C Randal

机构信息

Department of Computer Sciences, The University of Texas at Austin, Austin TX, USA.

出版信息

Algorithms Mol Biol. 2010 Jan 4;5:8. doi: 10.1186/1748-7188-5-8.

DOI:10.1186/1748-7188-5-8
PMID:20047664
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC2837663/
Abstract

BACKGROUND

Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined into a tree (the "supertree") on the entire set of taxa. Supertrees can be constructed using various algorithmic techniques, with the most common being matrix representation with parsimony (MRP). When the data allow, the competing approach is a combined analysis (also known as a "supermatrix" or "total evidence" approach) whereby the different sequence data matrices for each of the different subsets of taxa are concatenated into a single supermatrix, and a tree is estimated on that supermatrix.

RESULTS

In this paper, we describe an extensive simulation study we performed comparing two supertree methods, MRP and weighted MRP, to combined analysis methods on large model trees. A key contribution of this study is our novel simulation methodology (Super-Method Input Data Generator, or SMIDGen) that better reflects biological processes and the practices of systematists than earlier simulations. We show that combined analysis based upon maximum likelihood outperforms MRP and weighted MRP, giving especially big improvements when the largest subtree does not contain most of the taxa.

CONCLUSIONS

This study demonstrates that MRP and weighted MRP produce distinctly less accurate trees than combined analyses for a given base method (maximum parsimony or maximum likelihood). Since there are situations in which combined analyses are not feasible, there is a clear need for better supertree methods. The source tree and combined datasets used in this study can be used to test other supertree and combined analysis methods.

摘要

背景

超级树方法是在给定多标记数据集的情况下重建大型分子系统发育树的一种方法:先在每个标记上估计树,然后将这些树合并成一个包含所有分类单元的树(“超级树”)。超级树可以使用各种算法技术构建,最常见的是简约矩阵表示法(MRP)。在数据允许的情况下,另一种竞争方法是联合分析(也称为“超级矩阵”或“总证据”方法),即将每个不同分类单元子集的不同序列数据矩阵连接成一个单一的超级矩阵,并在该超级矩阵上估计一棵树。

结果

在本文中,我们描述了一项广泛的模拟研究,我们将两种超级树方法(MRP和加权MRP)与基于大型模型树的联合分析方法进行了比较。这项研究的一个关键贡献是我们新颖的模拟方法(超级方法输入数据生成器,或SMIDGen),它比早期的模拟更好地反映了生物过程和系统学家的实践。我们表明,基于最大似然法的联合分析优于MRP和加权MRP,当最大子树不包含大多数分类单元时,改进尤为显著。

结论

这项研究表明,对于给定的基本方法(最大简约法或最大似然法),MRP和加权MRP生成的树的准确性明显低于联合分析。由于在某些情况下联合分析不可行,显然需要更好的超级树方法。本研究中使用的源树和联合数据集可用于测试其他超级树和联合分析方法。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/cfb158435fa3/1748-7188-5-8-8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/7d1cb11d1369/1748-7188-5-8-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/109ddea28d93/1748-7188-5-8-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/cfd02da96674/1748-7188-5-8-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/5078504e59b4/1748-7188-5-8-4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/c4cceb40d41b/1748-7188-5-8-5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/852d48b57d52/1748-7188-5-8-6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/fc01cb4fd677/1748-7188-5-8-7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/cfb158435fa3/1748-7188-5-8-8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/7d1cb11d1369/1748-7188-5-8-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/109ddea28d93/1748-7188-5-8-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/cfd02da96674/1748-7188-5-8-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/5078504e59b4/1748-7188-5-8-4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/c4cceb40d41b/1748-7188-5-8-5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/852d48b57d52/1748-7188-5-8-6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/fc01cb4fd677/1748-7188-5-8-7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3467/2837663/cfb158435fa3/1748-7188-5-8-8.jpg

相似文献

1
A simulation study comparing supertree and combined analysis methods using SMIDGen.一项使用SMIDGen比较超树和联合分析方法的模拟研究。
Algorithms Mol Biol. 2010 Jan 4;5:8. doi: 10.1186/1748-7188-5-8.
2
Complete generic-level phylogenetic analyses of palms (Arecaceae) with comparisons of supertree and supermatrix approaches.全面进行棕榈科(Arecaceae)的类群水平系统发育分析,并比较了超级树和超级矩阵方法。
Syst Biol. 2009 Apr;58(2):240-56. doi: 10.1093/sysbio/syp021. Epub 2009 May 30.
3
MRL and SuperFine+MRL: new supertree methods.MRL和SuperFine+MRL:新的超树方法。
Algorithms Mol Biol. 2012 Jan 26;7(1):3. doi: 10.1186/1748-7188-7-3.
4
Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm.不良分支删除超树:一种快速且准确的超树算法。
Mol Biol Evol. 2017 Sep 1;34(9):2408-2421. doi: 10.1093/molbev/msx191.
5
Assessment of the accuracy of matrix representation with parsimony analysis supertree construction.基于简约分析超树构建法评估矩阵表示的准确性
Syst Biol. 2001 Aug;50(4):565-79.
6
Comparative performance of supertree algorithms in large data sets using the soapberry family (Sapindaceae) as a case study.利用肥皂草科(无患子科)作为案例研究,比较大数据集中超级树算法的性能。
Syst Biol. 2011 Jan;60(1):32-44. doi: 10.1093/sysbio/syq057. Epub 2010 Nov 10.
7
Performance of flip supertree construction with a heuristic algorithm.使用启发式算法进行翻转超树构建的性能
Syst Biol. 2004 Apr;53(2):299-308. doi: 10.1080/10635150490423719.
8
Improved heuristics for minimum-flip supertree construction.改进的最小翻转超树构建启发式算法。
Evol Bioinform Online. 2007 Feb 28;2:347-56.
9
SuperFine: fast and accurate supertree estimation.SuperFine:快速准确的超级树估计。
Syst Biol. 2012 Mar;61(2):214-27. doi: 10.1093/sysbio/syr092. Epub 2011 Sep 20.
10
Novel versus unsupported clades: assessing the qualitative support for clades in MRP supertrees.新分支与无支持分支:评估MRP超级树中分支的定性支持度
Syst Biol. 2003 Dec;52(6):839-48.

引用本文的文献

1
Spectral cluster supertree: fast and statistically robust merging of rooted phylogenetic trees.光谱聚类超树:有根系统发育树的快速且统计稳健的合并
Front Mol Biosci. 2024 Oct 30;11:1432495. doi: 10.3389/fmolb.2024.1432495. eCollection 2024.
2
GPTree Cluster: phylogenetic tree cluster generator in the context of supertree inference.GPTree 聚类:超级树推断背景下的系统发育树聚类生成器。
Bioinform Adv. 2023 Mar 3;3(1):vbad023. doi: 10.1093/bioadv/vbad023. eCollection 2023.
3
BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees.

本文引用的文献

1
Phylogenetic supertrees: Assembling the trees of life.系统发生超级树:组装生命之树。
Trends Ecol Evol. 1998 Mar;13(3):105-9. doi: 10.1016/S0169-5347(97)01242-1.
2
Improved heuristics for minimum-flip supertree construction.改进的最小翻转超树构建启发式算法。
Evol Bioinform Online. 2007 Feb 28;2:347-56.
3
Broad phylogenomic sampling improves resolution of the animal tree of life.广泛的系统发育基因组采样提高了动物生命树的分辨率。
BCD束搜索:在不良分支删除超树中考虑次优部分解。
PeerJ. 2018 Jun 8;6:e4987. doi: 10.7717/peerj.4987. eCollection 2018.
4
The performance of coalescent-based species tree estimation methods under models of missing data.基于合并的种系发生树估计方法在缺失数据模型下的性能。
BMC Genomics. 2018 May 8;19(Suppl 5):286. doi: 10.1186/s12864-018-4619-8.
5
SIESTA: enhancing searches for optimal supertrees and species trees.SIESTA:增强最优超级树和物种树搜索。
BMC Genomics. 2018 May 8;19(Suppl 5):252. doi: 10.1186/s12864-018-4621-1.
6
Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm.不良分支删除超树:一种快速且准确的超树算法。
Mol Biol Evol. 2017 Sep 1;34(9):2408-2421. doi: 10.1093/molbev/msx191.
7
FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization.FastRFS:使用约束精确优化的快速且准确的罗宾逊-福尔兹超树算法
Bioinformatics. 2017 Mar 1;33(5):631-639. doi: 10.1093/bioinformatics/btw600.
8
Collecting reliable clades using the Greedy Strict Consensus Merger.使用贪婪严格一致合并法收集可靠的进化枝。
PeerJ. 2016 Jun 28;4:e2172. doi: 10.7717/peerj.2172. eCollection 2016.
9
Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance.使用罗宾逊-福尔兹距离从不一致的多拷贝基因树推断物种树。
Algorithms Mol Biol. 2013 Nov 1;8(1):28. doi: 10.1186/1748-7188-8-28.
10
Conventional simulation of biological sequences leads to a biased assessment of multi-Loci phylogenetic analysis.常规的生物序列模拟会导致对多基因座系统发生分析的有偏评估。
Evol Bioinform Online. 2013 Aug 13;9:317-25. doi: 10.4137/EBO.S12483. eCollection 2013.
Nature. 2008 Apr 10;452(7188):745-9. doi: 10.1038/nature06614. Epub 2008 Mar 5.
4
The delayed rise of present-day mammals.现代哺乳动物的延迟崛起。
Nature. 2007 Mar 29;446(7135):507-12. doi: 10.1038/nature05634.
5
A higher-level MRP supertree of placental mammals.胎盘哺乳动物的高级MRP超级树。
BMC Evol Biol. 2006 Nov 13;6:93. doi: 10.1186/1471-2148-6-93.
6
SDM: a fast distance-based approach for (super) tree building in phylogenomics.SDM:一种用于系统发育基因组学中(超)树构建的基于距离的快速方法。
Syst Biol. 2006 Oct;55(5):740-55. doi: 10.1080/10635150600969872.
7
RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models.RAxML-VI-HPC:基于最大似然法的系统发育分析,适用于数千个分类单元及混合模型。
Bioinformatics. 2006 Nov 1;22(21):2688-90. doi: 10.1093/bioinformatics/btl446. Epub 2006 Aug 23.
8
The evolution of supertrees.超级树的演化
Trends Ecol Evol. 2004 Jun;19(6):315-22. doi: 10.1016/j.tree.2004.03.015.
9
A complete phylogeny of the whales, dolphins and even-toed hoofed mammals (Cetartiodactyla).鲸类、海豚以及偶蹄目哺乳动物(鲸偶蹄目)的完整系统发育树。
Biol Rev Camb Philos Soc. 2005 Aug;80(3):445-73. doi: 10.1017/s1464793105006743.
10
Bayesian inference of the metazoan phylogeny; a combined molecular and morphological approach.后生动物系统发育的贝叶斯推断;一种分子与形态相结合的方法。
Curr Biol. 2004 Sep 21;14(18):1644-9. doi: 10.1016/j.cub.2004.09.027.