.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
LARGE CHEMICAL DATABASES
CLUSTERING METHODS
LIBRARY DESIGN
LARGE NUMBER
DIVERSITY
SIMILARITY
FINGERPRINTS
DESCRIPTORS
MOLECULES
CHEMISTRY
Journal
IF:
5.3
Papers:
9.2K
Citations:
4.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveTriple positive pseudo-symmetric solutions to a four-point boundary value problem with p-Laplacian
PREAI
ShareSave
View more