.png){kind=icon}
返回
Accelerating Two Algorithms for Large-Scale Compound Selection on GPUs
.png){kind=icon}
PRE
AI
DOI：10.1021/ci200061p.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Compound selection procedures based on molecular similarity and diversity are widely used in drug discovery. Current algorithms are often time consuming when applied to very large compound sets. This paper describes the acceleration of two selection algorithms (the leader and the spread algorithms) on graphical processing units (GPUs). We first parallelized the molecular similarity calculation based on Daylight fingerprints and the Tanimoto index and then implemented the two algorithms on GPU hardware using the open source Thrust library. Experiments show that the GPU leader algorithm is 73-120 times faster than the CPU version, and the GPU spread algorithm is 78-143 times faster than the CPU version.
Keyword:
LARGE CHEMICAL DATABASES
CLUSTERING METHODS
LIBRARY DESIGN
LARGE NUMBER
DIVERSITY
SIMILARITY
FINGERPRINTS
DESCRIPTORS
MOLECULES
CHEMISTRY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.3
论文数:
9.2K
被引数:
4.0W
机构
引用论文
.png){kind=icon}
Triple positive pseudo-symmetric solutions to a four-point boundary value problem with p-Laplacian
PREAI
分享收藏
查看更多内容