基因重排和基因丢失的系统发育重建

Yiwei Zhang, Fei Hu, Jijun Tang
{"title":"基因重排和基因丢失的系统发育重建","authors":"Yiwei Zhang, Fei Hu, Jijun Tang","doi":"10.1109/BIBM.2010.5706531","DOIUrl":null,"url":null,"abstract":"Reconstructing phylogenies from gene-order data has become very attractive in the research of evolution these years. So far, most methods can only treat genomes with equal gene contents with each gene appearing exactly once in each genome. In this paper, we propose a new distance measurement for genomes with inversions and insertions/deletions that comply with triangle inequality. Based on this distance, we develop a new method to solve the median problem of unequal gene content, which are used to reconstruct both phylogenies and ancestral genomes. We test our method on simulated datasets under various conditions and the experimental results show that our distance measurement can produce more accurate phylogenetic trees compared with other popular methods for unequal genomes. Also our median algorithm produces remarkably more accurate ancestral genomes than the only unequal genome median solver that is currently available.","PeriodicalId":275098,"journal":{"name":"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Phylogenetic reconstruction with gene rearrangements and gene losses\",\"authors\":\"Yiwei Zhang, Fei Hu, Jijun Tang\",\"doi\":\"10.1109/BIBM.2010.5706531\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reconstructing phylogenies from gene-order data has become very attractive in the research of evolution these years. So far, most methods can only treat genomes with equal gene contents with each gene appearing exactly once in each genome. In this paper, we propose a new distance measurement for genomes with inversions and insertions/deletions that comply with triangle inequality. Based on this distance, we develop a new method to solve the median problem of unequal gene content, which are used to reconstruct both phylogenies and ancestral genomes. We test our method on simulated datasets under various conditions and the experimental results show that our distance measurement can produce more accurate phylogenetic trees compared with other popular methods for unequal genomes. Also our median algorithm produces remarkably more accurate ancestral genomes than the only unequal genome median solver that is currently available.\",\"PeriodicalId\":275098,\"journal\":{\"name\":\"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIBM.2010.5706531\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBM.2010.5706531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

近年来,利用基因序列数据重构系统发育已成为进化研究的热点。到目前为止,大多数方法只能处理基因含量相等的基因组,每个基因在每个基因组中只出现一次。在本文中,我们提出了一种新的符合三角不等式的基因组倒位和插入/缺失的距离测量方法。基于这一距离,我们提出了一种新的方法来解决基因含量不等的中值问题,并将其用于系统发育和祖先基因组的重建。我们在各种条件下的模拟数据集上测试了我们的方法,实验结果表明,与其他流行的不相等基因组方法相比,我们的距离测量方法可以产生更准确的系统发育树。此外,我们的中位数算法比目前可用的唯一不相等基因组中位数求解器产生更准确的祖先基因组。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Phylogenetic reconstruction with gene rearrangements and gene losses
Reconstructing phylogenies from gene-order data has become very attractive in the research of evolution these years. So far, most methods can only treat genomes with equal gene contents with each gene appearing exactly once in each genome. In this paper, we propose a new distance measurement for genomes with inversions and insertions/deletions that comply with triangle inequality. Based on this distance, we develop a new method to solve the median problem of unequal gene content, which are used to reconstruct both phylogenies and ancestral genomes. We test our method on simulated datasets under various conditions and the experimental results show that our distance measurement can produce more accurate phylogenetic trees compared with other popular methods for unequal genomes. Also our median algorithm produces remarkably more accurate ancestral genomes than the only unequal genome median solver that is currently available.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A gene ranking method using text-mining for the identification of disease related genes alns — A searchable and filterable sequence alignment format A fast and noise-adaptive rough-fuzzy hybrid algorithm for medical image segmentation An accurate, automatic method for markerless alignment of electron tomographic images Unsupervised integration of multiple protein disorder predictors
×
引用
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