识别系统发生网络中 Blob 的循环顺序

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED
John A. Rhodes , Hector Baños , Jingcheng Xu , Cécile Ané
{"title":"识别系统发生网络中 Blob 的循环顺序","authors":"John A. Rhodes ,&nbsp;Hector Baños ,&nbsp;Jingcheng Xu ,&nbsp;Cécile Ané","doi":"10.1016/j.aam.2024.102804","DOIUrl":null,"url":null,"abstract":"<div><div>Interest in the inference of evolutionary networks relating species or populations has grown with the increasing recognition of the importance of hybridization, gene flow and admixture, and the availability of large-scale genomic data. However, what network features may be validly inferred from various data types under different models remains poorly understood. Previous work has largely focused on level-1 networks, in which reticulation events are well separated, and on a general network's tree of blobs, the tree obtained by contracting every blob to a node. An open question is the identifiability of the topology of a blob of unknown level. We consider the identifiability of the circular order in which subnetworks attach to a blob, first proving that this order is well-defined for outer-labeled planar blobs. For this class of blobs, we show that the circular order information from 4-taxon subnetworks identifies the full circular order of the blob. Similarly, the circular order from 3-taxon rooted subnetworks identifies the full circular order of a rooted blob. We then show that subnetwork circular information is identifiable from certain data types and evolutionary models. This provides a general positive result for high-level networks, on the identifiability of the ordering in which taxon blocks attach to blobs in outer-labeled planar networks. Finally, we give examples of blobs with different internal structures which cannot be distinguished under many models and data types.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102804"},"PeriodicalIF":1.0000,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Identifying circular orders for blobs in phylogenetic networks\",\"authors\":\"John A. Rhodes ,&nbsp;Hector Baños ,&nbsp;Jingcheng Xu ,&nbsp;Cécile Ané\",\"doi\":\"10.1016/j.aam.2024.102804\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Interest in the inference of evolutionary networks relating species or populations has grown with the increasing recognition of the importance of hybridization, gene flow and admixture, and the availability of large-scale genomic data. However, what network features may be validly inferred from various data types under different models remains poorly understood. Previous work has largely focused on level-1 networks, in which reticulation events are well separated, and on a general network's tree of blobs, the tree obtained by contracting every blob to a node. An open question is the identifiability of the topology of a blob of unknown level. We consider the identifiability of the circular order in which subnetworks attach to a blob, first proving that this order is well-defined for outer-labeled planar blobs. For this class of blobs, we show that the circular order information from 4-taxon subnetworks identifies the full circular order of the blob. Similarly, the circular order from 3-taxon rooted subnetworks identifies the full circular order of a rooted blob. We then show that subnetwork circular information is identifiable from certain data types and evolutionary models. This provides a general positive result for high-level networks, on the identifiability of the ordering in which taxon blocks attach to blobs in outer-labeled planar networks. Finally, we give examples of blobs with different internal structures which cannot be distinguished under many models and data types.</div></div>\",\"PeriodicalId\":50877,\"journal\":{\"name\":\"Advances in Applied Mathematics\",\"volume\":\"163 \",\"pages\":\"Article 102804\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0196885824001362\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0196885824001362","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

随着人们越来越认识到杂交、基因流和混杂的重要性,以及大规模基因组数据的可用性,对物种或种群之间进化网络推断的兴趣与日俱增。然而,在不同的模型下,从不同的数据类型中可以有效推断出哪些网络特征,人们对此仍然知之甚少。以前的工作主要集中在网状事件分离得很好的一级网络,以及一般网络的 Blob 树,即通过将每个 Blob 收缩到一个节点而得到的树。一个悬而未决的问题是未知级别的 Blob 拓扑的可识别性。我们考虑了子网络连接到 Blob 的循环顺序的可识别性,首先证明了这种顺序对于外标签平面 Blob 来说是定义明确的。对于这类球体,我们证明了来自 4 个子网络的循环顺序信息可以识别球体的完整循环顺序。同样,来自 3 个子网络的有根圆球的圆序也能确定有根圆球的完整圆序。然后我们证明,子网络循环信息可以从某些数据类型和进化模型中识别出来。这为高层次网络提供了一个普遍的正面结果,即外层标记平面网络中分类群块附着于 Blob 的排序的可识别性。最后,我们举例说明了在许多模型和数据类型下无法区分的具有不同内部结构的球体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Identifying circular orders for blobs in phylogenetic networks
Interest in the inference of evolutionary networks relating species or populations has grown with the increasing recognition of the importance of hybridization, gene flow and admixture, and the availability of large-scale genomic data. However, what network features may be validly inferred from various data types under different models remains poorly understood. Previous work has largely focused on level-1 networks, in which reticulation events are well separated, and on a general network's tree of blobs, the tree obtained by contracting every blob to a node. An open question is the identifiability of the topology of a blob of unknown level. We consider the identifiability of the circular order in which subnetworks attach to a blob, first proving that this order is well-defined for outer-labeled planar blobs. For this class of blobs, we show that the circular order information from 4-taxon subnetworks identifies the full circular order of the blob. Similarly, the circular order from 3-taxon rooted subnetworks identifies the full circular order of a rooted blob. We then show that subnetwork circular information is identifiable from certain data types and evolutionary models. This provides a general positive result for high-level networks, on the identifiability of the ordering in which taxon blocks attach to blobs in outer-labeled planar networks. Finally, we give examples of blobs with different internal structures which cannot be distinguished under many models and data types.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Advances in Applied Mathematics
Advances in Applied Mathematics 数学-应用数学
CiteScore
2.00
自引率
9.10%
发文量
88
审稿时长
85 days
期刊介绍: Interdisciplinary in its coverage, Advances in Applied Mathematics is dedicated to the publication of original and survey articles on rigorous methods and results in applied mathematics. The journal features articles on discrete mathematics, discrete probability theory, theoretical statistics, mathematical biology and bioinformatics, applied commutative algebra and algebraic geometry, convexity theory, experimental mathematics, theoretical computer science, and other areas. Emphasizing papers that represent a substantial mathematical advance in their field, the journal is an excellent source of current information for mathematicians, computer scientists, applied mathematicians, physicists, statisticians, and biologists. Over the past ten years, Advances in Applied Mathematics has published research papers written by many of the foremost mathematicians of our time.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信