Drug target affinity prediction based on multi-scale gated power graph and multi-head linear attention mechanism

For the purpose of developing new drugs and repositioning existing ones, accurate drug-target affinity (DTA) prediction is essential. While graph neural networks are frequently utilized for DTA prediction, it is difficult for existing single-scale graph neural networks to access the global structure of compounds. We propose a novel DTA prediction model in this study, MAPGraphDTA, which uses an approach based on a multi-head linear attention mechanism that aggregates global features based on the attention weights and a multi-scale gated power graph that captures multi-hop connectivity relationships of graph nodes. In order to accurately extract drug target features, we provide a gated skip-connection approach in multiscale graph neural networks, which is used to fuse multiscale features to produce a rich representation of feature information. We experimented on the Davis, Kiba, Metz, and DTC datasets, and we evaluated the proposed method against other relevant models. Based on all evaluation metrics, MAPGraphDTA outperforms the other models, according to the results of the experiment. We also performed cold-start experiments on the Davis dataset, which showed that our model has good prediction ability for unseen drugs, unseen proteins, and cases where neither drugs nor proteins has been seen.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2025-02-21
DOI
https://doi.org/10.1371/journal.pone.0315718
Citations
2
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
3.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Drug target affinity prediction based on multi-scale gated power graph and multi-head linear attention mechanism

Xin Xu, Jing Hu, Su-Ping Jin, Shuo Hu et al.
2 citations
PLoS ONE
Computational Drug Discovery Methods
3.01
article

Drug target affinity prediction based on multi-scale gated power graph and multi-head linear attention mechanism

Xin Xu, Jing Hu, Su-Ping Jin, Shuo Hu, Xiaolong Zhang
article en
2 citations

Abstract

For the purpose of developing new drugs and repositioning existing ones, accurate drug-target affinity (DTA) prediction is essential. While graph neural networks are frequently utilized for DTA prediction, it is difficult for existing single-scale graph neural networks to access the global structure of compounds. We propose a novel DTA prediction model in this study, MAPGraphDTA, which uses an approach based on a multi-head linear attention mechanism that aggregates global features based on the attention weights and a multi-scale gated power graph that captures multi-hop connectivity relationships of graph nodes. In order to accurately extract drug target features, we provide a gated skip-connection approach in multiscale graph neural networks, which is used to fuse multiscale features to produce a rich representation of feature information. We experimented on the Davis, Kiba, Metz, and DTC datasets, and we evaluated the proposed method against other relevant models. Based on all evaluation metrics, MAPGraphDTA outperforms the other models, according to the results of the experiment. We also performed cold-start experiments on the Davis dataset, which showed that our model has good prediction ability for unseen drugs, unseen proteins, and cases where neither drugs nor proteins has been seen.

PLoS ONEVol. 20(2)
Wuhan University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 10%
Computational Drug Discovery Methods
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.