计算机科学
残余物
人工智能
融合
图形
交互网络
人工神经网络
变压器
数据挖掘
机器学习
理论(学习稳定性)
数量结构-活动关系
稳健性(进化)
数据集成
理论计算机科学
生物系统
算法
特征(语言学)
机制(生物学)
编码(内存)
网络拓扑
集合(抽象数据类型)
传感器融合
图论
模式识别(心理学)
特征提取
融合机制
药物发现
网络分析
化学
编码
作者
Ying Wang,Jing Hu,Junlin Xu,Bo Li
标识
DOI:10.1109/jbhi.2026.3656542
摘要
Protein-ligand binding affinity prediction is critical for drug discovery, yet existing methods struggle to jointly model local atomic interactions and global contextual dependencies. To address this, we propose the Interpretable Dual-Branch Graph-Transformer framework for Protein-Ligand Affinity prediction (DBGT-PLA), a novel dual-branch architecture that integrates graph neural network (GNN) with a stability-enhanced Transformer equipped with learnable positional embeddings and a NaN-filtering mechanism that handles potential Not-a-Number (NaN) values arising from numerical instability or data preprocessing. We design a Gated Residual Learning (GRL) Fusion module that performs dimension-wise adaptive integration between local graph topology and global Transformer context. This mechanism enables multi-level feature coordination through a residual path, achieving biophysically consistent alignment between atomic-level interactions and global conformational dependencies. Furthermore, we introduce an edge-level Shapley attribution framework tailored to protein-ligand interaction graphs, quantifying contributions of chemical bonds (e.g., hydrophobic contacts) and non-covalent interactions. Experiments show DBGT-PLA reduces RMSE by 18.3% (from 1.522 to 1.244 on the Holdout Set 2019), outperforming state-of-the-art models. Crucially, our explainability module reveals that the ligand edges dominate affinity predictions, accounting for nearly 70%. This work not only advances predictive accuracy but also offers unprecedented, quantitative insights into interaction determinants, which can guide rational drug optimization. The code of DBGT-PLA is publicly available at https://github.com/wangwying/DBGT-PLA.
科研通智能强力驱动
Strongly Powered by AbleSci AI