Enhancing protein–ligand pose prediction via dual-branch deep learning with docking-oriented multi-component loss and iterative refinement

IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Md Khorshed Alam, Julia Rahman, M A Hakim Newton, Mohammed Eunus Ali
{"title":"Enhancing protein–ligand pose prediction via dual-branch deep learning with docking-oriented multi-component loss and iterative refinement","authors":"Md Khorshed Alam,&nbsp;Julia Rahman,&nbsp;M A Hakim Newton,&nbsp;Mohammed Eunus Ali","doi":"10.1007/s10489-026-07475-9","DOIUrl":null,"url":null,"abstract":"<div><p>Protein-ligand pose prediction is a core task in structure-based drug discovery because it determines how a ligand fits within a protein pocket and directly affects downstream virtual screening and lead-optimization workflows. Recent graph neural network (GNN) methods have shown promise for protein-ligand pose prediction, while improving the accuracy of an initial docked pose remains an important task. In this work, we present KTransPose, a GNN-based protein-ligand pose-refinement framework that combines a dual-branch architecture, a docking-oriented multi-component loss, and iterative refinement. The dual-branch architecture combines a global pose transformation branch that predicts rotation and translation with a local coordinate correction branch that predicts atom-wise coordinate adjustments. The multi-component loss combines root mean squared distance (RMSD) when computed without rotational or translational alignment, mean squared error (MSE) after alignment by the Kabsch algorithm, intraligand distance regularization, and a protein-ligand clash penalty. We instantiate the framework with several GNN architectures and find that a TransformerConv-based model provides the strongest overall performance. Using the same preprocessing, initial docked poses, and evaluation procedure, KTransPose improves upon MedusaGraph on both PDBbind-2020 and CASF-2016 benchmark datasets, reducing the mean RMSD from 5.08 Å to 4.47 Å and from 4.81 Å to 4.24 Å respectively, corresponding to improvements of approximately 12% in both datasets.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"56 15","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2026-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10489-026-07475-9.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-026-07475-9","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Protein-ligand pose prediction is a core task in structure-based drug discovery because it determines how a ligand fits within a protein pocket and directly affects downstream virtual screening and lead-optimization workflows. Recent graph neural network (GNN) methods have shown promise for protein-ligand pose prediction, while improving the accuracy of an initial docked pose remains an important task. In this work, we present KTransPose, a GNN-based protein-ligand pose-refinement framework that combines a dual-branch architecture, a docking-oriented multi-component loss, and iterative refinement. The dual-branch architecture combines a global pose transformation branch that predicts rotation and translation with a local coordinate correction branch that predicts atom-wise coordinate adjustments. The multi-component loss combines root mean squared distance (RMSD) when computed without rotational or translational alignment, mean squared error (MSE) after alignment by the Kabsch algorithm, intraligand distance regularization, and a protein-ligand clash penalty. We instantiate the framework with several GNN architectures and find that a TransformerConv-based model provides the strongest overall performance. Using the same preprocessing, initial docked poses, and evaluation procedure, KTransPose improves upon MedusaGraph on both PDBbind-2020 and CASF-2016 benchmark datasets, reducing the mean RMSD from 5.08 Å to 4.47 Å and from 4.81 Å to 4.24 Å respectively, corresponding to improvements of approximately 12% in both datasets.

基于对接多组分损失和迭代改进的双分支深度学习增强蛋白质配体位姿预测
蛋白质配体位姿预测是基于结构的药物发现的核心任务,因为它决定了配体如何适应蛋白质口袋,并直接影响下游虚拟筛选和导联优化工作流程。最近的图神经网络(GNN)方法在蛋白质配体位姿预测方面显示出了前景,但提高初始对接位姿的准确性仍然是一个重要的任务。在这项工作中,我们提出了KTransPose,这是一个基于gnn的蛋白质配体姿态优化框架,它结合了双分支架构、面向对接的多组分损失和迭代优化。双分支架构结合了一个预测旋转和平移的全局姿态变换分支和一个预测原子坐标调整的局部坐标校正分支。多分量损失包括在不进行旋转或平移比对时计算的均方根距离(RMSD)、通过Kabsch算法比对后的均方误差(MSE)、配体内距离正则化以及蛋白质-配体碰撞惩罚。我们用几个GNN体系结构实例化了框架,发现基于transformerconvs的模型提供了最强的整体性能。使用相同的预处理、初始对接姿态和评估程序,KTransPose在PDBbind-2020和CASF-2016基准数据集上对MedusaGraph进行了改进,将平均RMSD分别从5.08 Å降低到4.47 Å和从4.81 Å降低到4.24 Å,相当于在两个数据集上提高了约12%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书