简化系统发生网络的转换

Johanna Heiss, Daniel H. Huson, Mike Steel
{"title":"简化系统发生网络的转换","authors":"Johanna Heiss, Daniel H. Huson, Mike Steel","doi":"arxiv-2408.16156","DOIUrl":null,"url":null,"abstract":"The evolutionary relationships between species are typically represented in\nthe biological literature by rooted phylogenetic trees. However, a tree fails\nto capture ancestral reticulate processes, such as the formation of hybrid\nspecies or lateral gene transfer events between lineages, and so the history of\nlife is more accurately described by a rooted phylogenetic network.\nNevertheless, phylogenetic networks may be complex and difficult to interpret,\nso biologists sometimes prefer a tree that summarises the central tree-like\ntrend of evolution. In this paper, we formally investigate methods for\ntransforming an arbitrary phylogenetic network into a tree (on the same set of\nleaves) and ask which ones (if any) satisfy a simple consistency condition.\nThis consistency condition states that if we add additional species into a\nphylogenetic network (without otherwise changing this original network) then\ntransforming this enlarged network into a rooted phylogenetic tree induces the\nsame tree on the original set of species as transforming the original network.\nWe show that the LSA (lowest stable ancestor) tree method satisfies this\nconsistency property, whereas several other commonly used methods (and a new\none we introduce) do not. We also briefly consider transformations that convert\narbitrary phylogenetic networks to another simpler class, namely normal\nnetworks.","PeriodicalId":501044,"journal":{"name":"arXiv - QuanBio - Populations and Evolution","volume":"3 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transformations to simplify phylogenetic networks\",\"authors\":\"Johanna Heiss, Daniel H. Huson, Mike Steel\",\"doi\":\"arxiv-2408.16156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The evolutionary relationships between species are typically represented in\\nthe biological literature by rooted phylogenetic trees. However, a tree fails\\nto capture ancestral reticulate processes, such as the formation of hybrid\\nspecies or lateral gene transfer events between lineages, and so the history of\\nlife is more accurately described by a rooted phylogenetic network.\\nNevertheless, phylogenetic networks may be complex and difficult to interpret,\\nso biologists sometimes prefer a tree that summarises the central tree-like\\ntrend of evolution. In this paper, we formally investigate methods for\\ntransforming an arbitrary phylogenetic network into a tree (on the same set of\\nleaves) and ask which ones (if any) satisfy a simple consistency condition.\\nThis consistency condition states that if we add additional species into a\\nphylogenetic network (without otherwise changing this original network) then\\ntransforming this enlarged network into a rooted phylogenetic tree induces the\\nsame tree on the original set of species as transforming the original network.\\nWe show that the LSA (lowest stable ancestor) tree method satisfies this\\nconsistency property, whereas several other commonly used methods (and a new\\none we introduce) do not. We also briefly consider transformations that convert\\narbitrary phylogenetic networks to another simpler class, namely normal\\nnetworks.\",\"PeriodicalId\":501044,\"journal\":{\"name\":\"arXiv - QuanBio - Populations and Evolution\",\"volume\":\"3 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - QuanBio - Populations and Evolution\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.16156\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - QuanBio - Populations and Evolution","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.16156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在生物学文献中,物种之间的进化关系通常由有根的系统发生树来表示。然而,系统发生网络可能很复杂,而且难以解释,因此生物学家有时更喜欢用一棵树来概括进化的中心树状趋势。在本文中,我们正式研究了将任意系统发生网络转化为树(在同一组叶子上)的方法,并询问哪些方法(如果有的话)满足一个简单的一致性条件。这个一致性条件指出,如果我们在一个系统发育网络中添加额外的物种(而不改变这个原始网络),那么将这个扩大的网络转化为有根的系统发育树,就会在原始物种集上生成与转化原始网络相同的树。我们证明,LSA(最低稳定祖先)树方法满足这个一致性属性,而其他几种常用方法(以及我们引入的一种新方法)则不满足这个一致性属性。我们还简要地考虑了将任意的系统发生网络转换为另一个更简单的类别,即正态网络的变换。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Transformations to simplify phylogenetic networks
The evolutionary relationships between species are typically represented in the biological literature by rooted phylogenetic trees. However, a tree fails to capture ancestral reticulate processes, such as the formation of hybrid species or lateral gene transfer events between lineages, and so the history of life is more accurately described by a rooted phylogenetic network. Nevertheless, phylogenetic networks may be complex and difficult to interpret, so biologists sometimes prefer a tree that summarises the central tree-like trend of evolution. In this paper, we formally investigate methods for transforming an arbitrary phylogenetic network into a tree (on the same set of leaves) and ask which ones (if any) satisfy a simple consistency condition. This consistency condition states that if we add additional species into a phylogenetic network (without otherwise changing this original network) then transforming this enlarged network into a rooted phylogenetic tree induces the same tree on the original set of species as transforming the original network. We show that the LSA (lowest stable ancestor) tree method satisfies this consistency property, whereas several other commonly used methods (and a new one we introduce) do not. We also briefly consider transformations that convert arbitrary phylogenetic networks to another simpler class, namely normal networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Biological arrow of time: Emergence of tangled information hierarchies and self-modelling dynamics k-mer-based approaches to bridging pangenomics and population genetics A weather-driven mathematical model of Culex population abundance and the impact of vector control interventions Dynamics of solutions to a multi-patch epidemic model with a saturation incidence mechanism Higher-order interactions in random Lotka-Volterra communities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1