计算机科学
卷积神经网络
稳健性(进化)
人工神经网络
数量结构-活动关系
人工智能
图形
药物发现
图同构
机器学习
化学
理论计算机科学
生物化学
折线图
基因
作者
Ghaith Mqawass,Petr Popov
标识
DOI:10.1021/acs.jcim.3c00771
摘要
Predicting the binding affinity of protein–ligand complexes is crucial for computer-aided drug discovery (CADD) and the identification of potential drug candidates. The deep learning-based scoring functions have emerged as promising predictors of binding constants. Building on recent advancements in graph neural networks, we present graphLambda for protein–ligand binding affinity prediction, which utilizes graph convolutional, attention, and isomorphism blocks to enhance the predictive capabilities. The graphLambda model exhibits superior performance across CASF16 and CSAR HiQ NRC benchmarks and demonstrates robustness with respect to different types of train-validation set partitions. The development of graphLambda underscores the potential of graph neural networks in advancing binding affinity prediction models, contributing to more effective CADD methodologies.
科研通智能强力驱动
Strongly Powered by AbleSci AI