基于GPU的漏斗生成加速蛋白质复合物验证

Michael Zabejansky, H. Wolfson
{"title":"基于GPU的漏斗生成加速蛋白质复合物验证","authors":"Michael Zabejansky, H. Wolfson","doi":"10.1109/BIBM.2016.7822510","DOIUrl":null,"url":null,"abstract":"A major challenge in protein-protein docking is the distinction between near-native and decoy complex predictions. It has been shown that near native solutions are usually located at the bottom of deep and densely populated funnels in the binding energy plot of the complex. Thus exploration, whether the energy plot of the vicinity of a docking solution is “funnel like”, can serve as a validation of such a solution. Generation of such densely sampled plots, however, is a major computational challenge. We have designed an accurate and highly efficient parallel algorithm for generation of such energy plots and implemented it on a server with 4 GPU processors, each with 2880 cores. The algorithm achieved a speedup of about 150 compared to its serial counterpart, while even outperforming it in the achieved results. While the algorithm proved very useful for near native complex hypothesis validation, it still detects many funnels for decoy solutions, especially those with good shape complementarity.","PeriodicalId":345384,"journal":{"name":"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"529 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Accelerating protein-protein complex validation by GPU based funnel generation\",\"authors\":\"Michael Zabejansky, H. Wolfson\",\"doi\":\"10.1109/BIBM.2016.7822510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A major challenge in protein-protein docking is the distinction between near-native and decoy complex predictions. It has been shown that near native solutions are usually located at the bottom of deep and densely populated funnels in the binding energy plot of the complex. Thus exploration, whether the energy plot of the vicinity of a docking solution is “funnel like”, can serve as a validation of such a solution. Generation of such densely sampled plots, however, is a major computational challenge. We have designed an accurate and highly efficient parallel algorithm for generation of such energy plots and implemented it on a server with 4 GPU processors, each with 2880 cores. The algorithm achieved a speedup of about 150 compared to its serial counterpart, while even outperforming it in the achieved results. While the algorithm proved very useful for near native complex hypothesis validation, it still detects many funnels for decoy solutions, especially those with good shape complementarity.\",\"PeriodicalId\":345384,\"journal\":{\"name\":\"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)\",\"volume\":\"529 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIBM.2016.7822510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBM.2016.7822510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

蛋白质对接的一个主要挑战是近原生和诱饵复杂预测之间的区别。研究表明,在配合物结合能图中,近天然解通常位于深而密集的漏斗的底部。因此,探索对接解附近的能量图是否为“漏斗状”,可以作为对该解的验证。然而,生成如此密集的采样图是一个主要的计算挑战。我们设计了一种精确高效的并行算法来生成这样的能量图,并在具有4个GPU处理器的服务器上实现,每个处理器具有2880核。与串行算法相比,该算法实现了大约150倍的加速,而在实现的结果中甚至优于串行算法。虽然该算法对近原生复杂假设验证非常有用,但它仍然检测到许多诱饵解的漏斗,特别是那些具有良好形状互补性的诱饵解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accelerating protein-protein complex validation by GPU based funnel generation
A major challenge in protein-protein docking is the distinction between near-native and decoy complex predictions. It has been shown that near native solutions are usually located at the bottom of deep and densely populated funnels in the binding energy plot of the complex. Thus exploration, whether the energy plot of the vicinity of a docking solution is “funnel like”, can serve as a validation of such a solution. Generation of such densely sampled plots, however, is a major computational challenge. We have designed an accurate and highly efficient parallel algorithm for generation of such energy plots and implemented it on a server with 4 GPU processors, each with 2880 cores. The algorithm achieved a speedup of about 150 compared to its serial counterpart, while even outperforming it in the achieved results. While the algorithm proved very useful for near native complex hypothesis validation, it still detects many funnels for decoy solutions, especially those with good shape complementarity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信