GPU Accelerated Maximum Likelihood Analysis for Phylogenetic Inference

S. Rajapaksa, W. Rasanjana, I. Perera, D. Meedeniya
{"title":"GPU Accelerated Maximum Likelihood Analysis for Phylogenetic Inference","authors":"S. Rajapaksa, W. Rasanjana, I. Perera, D. Meedeniya","doi":"10.1145/3316615.3316630","DOIUrl":null,"url":null,"abstract":"With the advancement of biology and computer science, the amount of DNA sequences has grown at a rapid rate giving rise to the analysis of phylogenetic trees with many taxa. The maximum likelihood analysis is commonly considered as the best approach in phylogenetic analyses, which is extremely intensive for computation. Availability of computer resources and the application of modern technologies are key factors that determine the use of such analyses. The paper presents a parallel implementation of a GPU accelerated maximum likelihood inference of phylogenetic trees on DNAml program of the PHYLIP package. The improved DNAml program uses both GPU and CPU processing to perform compute-intensive tasks in phylogenetic analyses. The evaluation results show a speedup of x2.94 for the GPU accelerated DNAml program than the existing program. As the results show the proposed system saves the processing time increasingly against the current system with the number of taxa.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3316615.3316630","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

With the advancement of biology and computer science, the amount of DNA sequences has grown at a rapid rate giving rise to the analysis of phylogenetic trees with many taxa. The maximum likelihood analysis is commonly considered as the best approach in phylogenetic analyses, which is extremely intensive for computation. Availability of computer resources and the application of modern technologies are key factors that determine the use of such analyses. The paper presents a parallel implementation of a GPU accelerated maximum likelihood inference of phylogenetic trees on DNAml program of the PHYLIP package. The improved DNAml program uses both GPU and CPU processing to perform compute-intensive tasks in phylogenetic analyses. The evaluation results show a speedup of x2.94 for the GPU accelerated DNAml program than the existing program. As the results show the proposed system saves the processing time increasingly against the current system with the number of taxa.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GPU加速系统发育推断的最大似然分析
随着生物学和计算机科学的进步,DNA序列的数量以快速的速度增长,导致了对许多分类群的系统发育树的分析。最大似然分析通常被认为是系统发育分析的最佳方法,但其计算量非常大。计算机资源的可用性和现代技术的应用是决定使用这种分析的关键因素。本文提出了一种基于GPU加速的系统发育树最大似然推断的并行实现方法。改进的DNAml程序使用GPU和CPU处理来执行系统发育分析中的计算密集型任务。评估结果表明,与现有程序相比,GPU加速的DNAml程序的速度提高了x2.94。结果表明,随着分类群数量的增加,所提出的系统在处理时间上比现有系统有了显著的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
BookCeption An Enhanced Key Security of Playfair Cipher Algorithm Adoption Issues in DevOps from the Perspective of Continuous Delivery Pipeline A User Attribute Recommendation Algorithm and Peer3D Technology based WebVR P2P Transmission Scheme Survey of Hyperledger Blockchain Frameworks: Case Study in FPT University's Cryptocurrency Wallets
×
引用
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