{"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}
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.