Explainable Deep Relational Networks for Predicting Compound–Protein Affinities and Contacts

可解释性 亲缘关系 人工智能 机器学习 结合亲和力 概化理论 计算机科学 人工神经网络 化学 数学 立体化学 生物化学 统计 受体
作者
Mostafa Karimi,Di Wu,Zhangyang Wang,Yang Shen
出处
期刊:Journal of Chemical Information and Modeling [American Chemical Society]
卷期号:61 (1): 46-66 被引量:34
标识
DOI:10.1021/acs.jcim.0c00866
摘要

Predicting compound-protein affinity is beneficial for accelerating drug discovery. Doing so without the often-unavailable structure data is gaining interest. However, recent progress in structure-free affinity prediction, made by machine learning, focuses on accuracy but leaves much to be desired for interpretability. Defining intermolecular contacts underlying affinities as a vehicle for interpretability; our large-scale interpretability assessment finds previously used attention mechanisms inadequate. We thus formulate a hierarchical multiobjective learning problem, where predicted contacts form the basis for predicted affinities. We solve the problem by embedding protein sequences (by hierarchical recurrent neural networks) and compound graphs (by graph neural networks) with joint attentions between protein residues and compound atoms. We further introduce three methodological advances to enhance interpretability: (1) structure-aware regularization of attentions using protein sequence-predicted solvent exposure and residue-residue contact maps; (2) supervision of attentions using known intermolecular contacts in training data; and (3) an intrinsically explainable architecture where atomic-level contacts or "relations" lead to molecular-level affinity prediction. The first two and all three advances result in DeepAffinity+ and DeepRelations, respectively. Our methods show generalizability in affinity prediction for molecules that are new and dissimilar to training examples. Moreover, they show superior interpretability compared to state-of-the-art interpretable methods: with similar or better affinity prediction, they boost the AUPRC of contact prediction by around 33-, 35-, 10-, and 9-fold for the default test, new-compound, new-protein, and both-new sets, respectively. We further demonstrate their potential utilities in contact-assisted docking, structure-free binding site prediction, and structure-activity relationship studies without docking. Our study represents the first model development and systematic model assessment dedicated to interpretable machine learning for structure-free compound-protein affinity prediction.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
FashionBoy应助yaqingzi采纳,获得10
刚刚
1秒前
我要找到你完成签到 ,获得积分10
3秒前
虾米君发布了新的文献求助10
3秒前
hong发布了新的文献求助10
3秒前
yps发布了新的文献求助10
5秒前
fantexi113发布了新的文献求助10
6秒前
木南楠a完成签到,获得积分10
8秒前
ala完成签到,获得积分10
8秒前
maomao完成签到,获得积分10
9秒前
10秒前
10秒前
小点点完成签到,获得积分10
13秒前
maomao发布了新的文献求助10
14秒前
dddd17关注了科研通微信公众号
15秒前
sophyia完成签到,获得积分20
16秒前
汉堡包应助科研通管家采纳,获得10
16秒前
田様应助科研通管家采纳,获得10
16秒前
16秒前
xs完成签到,获得积分10
16秒前
小点点发布了新的文献求助10
17秒前
zz完成签到,获得积分10
17秒前
yps发布了新的文献求助100
17秒前
hxm完成签到,获得积分10
17秒前
李健应助fantexi113采纳,获得10
19秒前
19秒前
集力申完成签到,获得积分10
20秒前
22秒前
23秒前
愉快凝梦完成签到 ,获得积分10
23秒前
lfl发布了新的文献求助10
27秒前
28秒前
细腻的怀蕊完成签到 ,获得积分10
29秒前
ooseabiscuit完成签到,获得积分10
29秒前
31秒前
acd发布了新的文献求助10
33秒前
研友_850EYZ完成签到,获得积分10
36秒前
36秒前
37秒前
38秒前
高分求助中
Teaching Social and Emotional Learning in Physical Education 900
Recherches Ethnographiques sue les Yao dans la Chine du Sud 500
Plesiosaur extinction cycles; events that mark the beginning, middle and end of the Cretaceous 500
Two-sample Mendelian randomization analysis reveals causal relationships between blood lipids and venous thromboembolism 500
Chinese-English Translation Lexicon Version 3.0 500
[Lambert-Eaton syndrome without calcium channel autoantibodies] 440
薩提亞模式團體方案對青年情侶輔導效果之研究 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2388639
求助须知:如何正确求助?哪些是违规求助? 2094819
关于积分的说明 5274498
捐赠科研通 1821785
什么是DOI,文献DOI怎么找? 908696
版权声明 559437
科研通“疑难数据库(出版商)”最低求助积分说明 485524