模拟病毒种群进化的快速求解器

Gerhard Niederbrucker, W. Gansterer
{"title":"模拟病毒种群进化的快速求解器","authors":"Gerhard Niederbrucker, W. Gansterer","doi":"10.1145/2063384.2063483","DOIUrl":null,"url":null,"abstract":"Solving Eigen's quasispecies model for the evolution of virus populations involves the computation of the dominant eigen vector of a matrix whose size N grows exponentially with the chain length of the virus to be modeled. Most biologically interesting chain lengths are so far well beyond the reach of existing algorithms and hardware. We show how to exploit the special properties of the problem under consideration and design a fast and accurate solver which reduces the complexity to Θ(N log2 N). Our solver is even faster than existing approximative strategies and contrary to those it can also be applied to more general formulations of the quasispecies model. Substantial further improvements and high parallelism can be achieved for special fitness landscapes in the evolution model. Beyond theoretical analysis, we evaluate the performance of our new solver experimentally on a GPU with an OpenCL implementation and illustrate that it achieves speedup factors of more than 107 over standard approaches.","PeriodicalId":358797,"journal":{"name":"2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)","volume":"269 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A fast solver for modeling the evolution of virus populations\",\"authors\":\"Gerhard Niederbrucker, W. Gansterer\",\"doi\":\"10.1145/2063384.2063483\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Solving Eigen's quasispecies model for the evolution of virus populations involves the computation of the dominant eigen vector of a matrix whose size N grows exponentially with the chain length of the virus to be modeled. Most biologically interesting chain lengths are so far well beyond the reach of existing algorithms and hardware. We show how to exploit the special properties of the problem under consideration and design a fast and accurate solver which reduces the complexity to Θ(N log2 N). Our solver is even faster than existing approximative strategies and contrary to those it can also be applied to more general formulations of the quasispecies model. Substantial further improvements and high parallelism can be achieved for special fitness landscapes in the evolution model. Beyond theoretical analysis, we evaluate the performance of our new solver experimentally on a GPU with an OpenCL implementation and illustrate that it achieves speedup factors of more than 107 over standard approaches.\",\"PeriodicalId\":358797,\"journal\":{\"name\":\"2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)\",\"volume\":\"269 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2063384.2063483\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2063384.2063483","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

求解病毒种群进化的Eigen准物种模型涉及计算矩阵的优势特征向量,该矩阵的大小N随待建模病毒的链长呈指数增长。迄今为止,大多数生物学上有趣的链长度远远超出了现有算法和硬件的范围。我们展示了如何利用所考虑的问题的特殊性质,并设计了一个快速准确的求解器,将复杂性降低到Θ(N log2 N)。我们的求解器比现有的近似策略更快,并且与那些相反,它也可以应用于准种模型的更一般的公式。对于进化模型中的特殊适应度景观,可以实现进一步的改进和高并行性。除了理论分析之外,我们在具有OpenCL实现的GPU上实验评估了我们的新求解器的性能,并说明它比标准方法实现了超过107的加速因子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fast solver for modeling the evolution of virus populations
Solving Eigen's quasispecies model for the evolution of virus populations involves the computation of the dominant eigen vector of a matrix whose size N grows exponentially with the chain length of the virus to be modeled. Most biologically interesting chain lengths are so far well beyond the reach of existing algorithms and hardware. We show how to exploit the special properties of the problem under consideration and design a fast and accurate solver which reduces the complexity to Θ(N log2 N). Our solver is even faster than existing approximative strategies and contrary to those it can also be applied to more general formulations of the quasispecies model. Substantial further improvements and high parallelism can be achieved for special fitness landscapes in the evolution model. Beyond theoretical analysis, we evaluate the performance of our new solver experimentally on a GPU with an OpenCL implementation and illustrate that it achieves speedup factors of more than 107 over standard approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信