GraphscoreDTA: optimized graph neural network for protein–ligand binding affinity prediction
Bioinformatics · 01.06.2023 · 39 (6)
DOI: 10.1093/bioinformatics/btad340 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bioinformatics, online erschienen am 24.05.2023. Verfasst von Kaili Wang und 3 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science and Engineering, Central South University, Changsha 410083, China. Hauptthemen laut MEDLINE: Proteins, Neural Networks, Computer. Die Arbeit wurde bisher 93-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Hunan Provincial Science and Technology Program.
Abstract (Originalsprache)
Motivation Computational approaches for identifying the protein–ligand binding affinity can greatly facilitate drug discovery and development. At present, many deep learning-based models are proposed to predict the protein–ligand binding affinity and achieve significant performance improvement. However, protein–ligand binding affinity prediction still has fundamental challenges. One challenge is that the mutual information between proteins and ligands is hard to capture. Another challenge is how to find and highlight the important atoms of the ligands and residues of the proteins. Results To solve these limitations, we develop a novel graph neural network strategy with the Vina distance optimization terms (GraphscoreDTA) for predicting protein–ligand binding affinity, which takes the combination of graph neural network, bitransport information mechanism and physics-based distance terms into account for the first time. Unlike other methods, GraphscoreDTA can not only effectively capture the protein–ligand pairs’ mutual information but also highlight the important atoms of the ligands and residues of the proteins. The results show that GraphscoreDTA significantly outperforms existing methods on multiple test sets. Furthermore, the tests of drug–target selectivity on the cyclin-dependent kinase and the homologous protein families demonstrate that GraphscoreDTA is a reliable tool for protein–ligand binding affinity prediction. Availability and implementation The resource codes are available at https://github.com/CSUBioGroup/GraphscoreDTA.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Substanzen
Autor:innen und Institutionen
- School of Computer Science and Engineering, Central South University, Changsha 410083, China.
- Research Program in Systems Oncology, University of Helsinki, 00014 Helsinki, Finland.
- Department of Biochemistry and Developmental Biology, University of Helsinki, 00014 Helsinki, Finland.
- Hunan Provincial Engineering Research Center of Intelligent Computing in Biology and Medicine, Changsha 410083, China.
ORCID-Profile: Min Li
Förderung
- National Natural Science Foundation of China
- Hunan Provincial Science and Technology Program
Zitieren
APA
Wang, K., Zhou, R., Tang, J., & Li, M. (2023). GraphscoreDTA: optimized graph neural network for protein–ligand binding affinity prediction. Bioinformatics, 39(6). https://doi.org/10.1093/bioinformatics/btad340
Vancouver
Wang K, Zhou R, Tang J, Li M. GraphscoreDTA: optimized graph neural network for protein–ligand binding affinity prediction. Bioinformatics. 2023;39(6). doi:10.1093/bioinformatics/btad340
BibTeX
@article{Wang2023,
author = {Wang, Kaili and Zhou, Renyi and Tang, Jing and Li, Min},
title = {GraphscoreDTA: optimized graph neural network for protein–ligand binding affinity prediction},
journal = {Bioinformatics},
year = {2023},
volume = {39},
number = {6},
doi = {10.1093/bioinformatics/btad340}
}
EUVIMED