posted on 2023-06-15, 20:33authored byXiangying Zhang, Haotian Gao, Haojie Wang, Zhihang Chen, Zhe Zhang, Xinchong Chen, Yan Li, Yifei Qi, Renxiao Wang
Predicting protein–ligand
binding affinity is a central
issue in drug design. Various deep learning models have been published
in recent years, where many of them rely on 3D protein–ligand
complex structures as input and tend to focus on the single task of
reproducing binding affinity. In this study, we have developed a graph
neural network model called PLANET (Protein–Ligand Affinity
prediction NETwork). This model takes the graph-represented 3D structure
of the binding pocket on the target protein and the 2D chemical structure
of the ligand molecule as input. It was trained through a multi-objective
process with three related tasks, including deriving the protein–ligand
binding affinity, protein–ligand contact map, and ligand distance
matrix. Besides the protein–ligand complexes with known binding
affinity data retrieved from the PDBbind database, a large number
of non-binder decoys were also added to the training data for deriving
the final model of PLANET. When tested on the CASF-2016 benchmark,
PLANET exhibited a scoring power comparable to the best result yielded
by other deep learning models as well as a reasonable ranking power
and docking power. In virtual screening trials conducted on the DUD-E
benchmark, PLANET’s performance was notably better than several
deep learning and machine learning models. As on the LIT-PCBA benchmark,
PLANET achieved comparable accuracy as the conventional docking program
Glide, but it only spent less than 1% of Glide’s computation
time to finish the same job because PLANET did not need exhaustive
conformational sampling. Considering the decent accuracy and efficiency
of PLANET in binding affinity prediction, it may become a useful tool
for conducting large-scale virtual screening.