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

立即免费体验

精炼不一致的基因树。

Refining discordant gene trees.

作者信息

Górecki Pawel, Eulenstein Oliver

出版信息

BMC Bioinformatics. 2014;15 Suppl 13(Suppl 13):S3. doi: 10.1186/1471-2105-15-S13-S3. Epub 2014 Nov 13.

DOI:10.1186/1471-2105-15-S13-S3
PMID:25434729
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC4248651/
Abstract

BACKGROUND

Evolutionary studies are complicated by discordance between gene trees and the species tree in which they evolved. Dealing with discordant trees often relies on comparison costs between gene and species trees, including the well-established Robinson-Foulds, gene duplication, and deep coalescence costs. While these costs have provided credible results for binary rooted gene trees, corresponding cost definitions for non-binary unrooted gene trees, which are frequently occurring in practice, are challenged by biological realism.

RESULT

We propose a natural extension of the well-established costs for comparing unrooted and non-binary gene trees with rooted binary species trees using a binary refinement model. For the duplication cost we describe an efficient algorithm that is based on a linear time reduction and also computes an optimal rooted binary refinement of the given gene tree. Finally, we show that similar reductions lead to solutions for computing the deep coalescence and the Robinson-Foulds costs.

CONCLUSION

Our binary refinement of Robinson-Foulds, gene duplication, and deep coalescence costs for unrooted and non-binary gene trees together with the linear time reductions provided here for computing these costs significantly extends the range of trees that can be incorporated into approaches dealing with discordance.

摘要

背景

基因树与其进化所在的物种树之间的不一致使进化研究变得复杂。处理不一致的树通常依赖于基因树和物种树之间的比较成本,包括已确立的罗宾逊 - 福尔兹成本、基因复制成本和深度合并成本。虽然这些成本为有根二叉基因树提供了可靠的结果,但对于实践中经常出现的无根非二叉基因树,相应的成本定义受到生物学现实的挑战。

结果

我们提出了一种自然扩展,使用二叉细化模型将已确立的用于比较无根和非二叉基因树与有根二叉物种树的成本进行扩展。对于复制成本,我们描述了一种基于线性时间归约的高效算法,该算法还计算给定基因树的最优有根二叉细化。最后,我们表明类似的归约可得出计算深度合并成本和罗宾逊 - 福尔兹成本的解决方案。

结论

我们对无根和非二叉基因树的罗宾逊 - 福尔兹成本、基因复制成本和深度合并成本进行的二叉细化,以及此处提供的用于计算这些成本的线性时间归约,显著扩展了可纳入处理不一致性方法的树的范围。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/ef757c32d590/1471-2105-15-S13-S3-5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/1e20058cef69/1471-2105-15-S13-S3-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/96a1d919bc92/1471-2105-15-S13-S3-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/7ef9e2a80a09/1471-2105-15-S13-S3-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/4f296912e856/1471-2105-15-S13-S3-4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/ef757c32d590/1471-2105-15-S13-S3-5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/1e20058cef69/1471-2105-15-S13-S3-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/96a1d919bc92/1471-2105-15-S13-S3-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/7ef9e2a80a09/1471-2105-15-S13-S3-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/4f296912e856/1471-2105-15-S13-S3-4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/bbf6/4248651/ef757c32d590/1471-2105-15-S13-S3-5.jpg

相似文献

1
Refining discordant gene trees.精炼不一致的基因树。
BMC Bioinformatics. 2014;15 Suppl 13(Suppl 13):S3. doi: 10.1186/1471-2105-15-S13-S3. Epub 2014 Nov 13.
2
Inferring Optimal Species Trees in the Presence of Gene Duplication and Loss: Beyond Rooted Gene Trees.在存在基因复制和丢失的情况下推断最优物种树:超越有根基因树。
J Comput Biol. 2023 Feb;30(2):161-175. doi: 10.1089/cmb.2021.0522. Epub 2022 Oct 13.
3
Are the duplication cost and Robinson-Foulds distance equivalent?重复成本与罗宾逊-福尔兹距离相等吗?
J Comput Biol. 2014 Aug;21(8):578-90. doi: 10.1089/cmb.2014.0021. Epub 2014 Jul 2.
4
Exact median-tree inference for unrooted reconciliation costs.无根配准代价的精确中位数树推断。
BMC Evol Biol. 2020 Oct 28;20(Suppl 1):136. doi: 10.1186/s12862-020-01700-w.
5
Statistical inconsistency of the unrooted minimize deep coalescence criterion.无根最小深度融合准则的统计不一致性。
PLoS One. 2021 May 10;16(5):e0251107. doi: 10.1371/journal.pone.0251107. eCollection 2021.
6
Genomic duplication problems for unrooted gene trees.无根基因树的基因组重复问题。
BMC Genomics. 2016 Jan 11;17 Suppl 1(Suppl 1):15. doi: 10.1186/s12864-015-2308-4.
7
Algorithms for MDC-based multi-locus phylogeny inference: beyond rooted binary gene trees on single alleles.基于MDC的多位点系统发育推断算法:超越单等位基因上的有根二叉基因树。
J Comput Biol. 2011 Nov;18(11):1543-59. doi: 10.1089/cmb.2011.0174. Epub 2011 Oct 28.
8
Unrooted tree reconciliation: a unified approach.无根树 reconcilement:一种统一的方法。
IEEE/ACM Trans Comput Biol Bioinform. 2013 Mar-Apr;10(2):522-36. doi: 10.1109/TCBB.2013.22.
9
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost.无约束复制损耗成本和损耗成本的直径。
IEEE/ACM Trans Comput Biol Bioinform. 2021 Nov-Dec;18(6):2125-2135. doi: 10.1109/TCBB.2019.2919617. Epub 2021 Dec 8.
10
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem.算法:同时进行纠错和根系重建,以解决基因树协调和基因复制问题。
BMC Bioinformatics. 2012 Jun 25;13 Suppl 10(Suppl 10):S14. doi: 10.1186/1471-2105-13-S10-S14.

引用本文的文献

1
Extracting functional trends from whole genome duplication events using comparative genomics.利用比较基因组学从全基因组复制事件中提取功能趋势。
Biol Proced Online. 2016 May 10;18:11. doi: 10.1186/s12575-016-0041-2. eCollection 2016.

本文引用的文献

1
RECONSTRUCTING CHARACTER EVOLUTION ON POLYTOMOUS CLADOGRAMS.在多歧分支系统树上重建性状演化
Cladistics. 1989 Dec;5(4):365-377. doi: 10.1111/j.1096-0031.1989.tb00569.x.
2
Are the duplication cost and Robinson-Foulds distance equivalent?重复成本与罗宾逊-福尔兹距离相等吗?
J Comput Biol. 2014 Aug;21(8):578-90. doi: 10.1089/cmb.2014.0021. Epub 2014 Jul 2.
3
Unrooted tree reconciliation: a unified approach.无根树 reconcilement:一种统一的方法。
IEEE/ACM Trans Comput Biol Bioinform. 2013 Mar-Apr;10(2):522-36. doi: 10.1109/TCBB.2013.22.
4
TreeFix: statistically informed gene tree error correction using species trees.TreeFix:使用物种树进行统计信息驱动的基因树错误校正。
Syst Biol. 2013 Jan 1;62(1):110-20. doi: 10.1093/sysbio/sys076. Epub 2012 Sep 4.
5
The Paleozoic origin of enzymatic lignin decomposition reconstructed from 31 fungal genomes.从 31 个真菌基因组重建的酶促木质素分解的古生代起源。
Science. 2012 Jun 29;336(6089):1715-9. doi: 10.1126/science.1221748.
6
Turning the crown upside down: gene tree parsimony roots the eukaryotic tree of life.将皇冠倒置:基因树简约为真核生物生命之树定根。
Syst Biol. 2012 Jul;61(4):653-60. doi: 10.1093/sysbio/sys026. Epub 2012 Feb 14.
7
Applications of next-generation sequencing to phylogeography and phylogenetics.下一代测序在系统地理学和系统发生学中的应用。
Mol Phylogenet Evol. 2013 Feb;66(2):526-38. doi: 10.1016/j.ympev.2011.12.007. Epub 2011 Dec 14.
8
Algorithms for MDC-based multi-locus phylogeny inference: beyond rooted binary gene trees on single alleles.基于MDC的多位点系统发育推断算法:超越单等位基因上的有根二叉基因树。
J Comput Biol. 2011 Nov;18(11):1543-59. doi: 10.1089/cmb.2011.0174. Epub 2011 Oct 28.
9
Resolving difficult phylogenetic questions: why more sequences are not enough.解决复杂的系统发育问题:为何更多序列并不足够。
PLoS Biol. 2011 Mar;9(3):e1000602. doi: 10.1371/journal.pbio.1000602. Epub 2011 Mar 15.
10
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.具有重复和缺失的基因树进化的最大似然模型和算法。
BMC Bioinformatics. 2011 Feb 15;12 Suppl 1(Suppl 1):S15. doi: 10.1186/1471-2105-12-S1-S15.