Evidence map›Paper›PMID 41413775›Full record

ArticleBMC bioinformatics2025

A geometric graph-based deep learning model for drug-target affinity prediction.

Md Masud Rana, Farjana Tasnim Mukta, Duc D Nguyen

Abstract read
In one paragraph

Article in BMC bioinformatics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Md Masud RanaDepartment of Mathematics, Kennesaw State University, Kennesaw, GA, 30144, USA. mrana10@kennesaw.edu.
Farjana Tasnim MuktaDepartment of Mathematics, Kennesaw State University, Kennesaw, GA, 30144, USA.
Duc D NguyenDepartment of Mathematics, University of Tennessee, Knoxville, TN, 37916, USA. ducnguyen@utk.edu.

Funding

NSF 2516126, 2151802, 2534947
6 · The paper itself

Abstract

In structure-based drug design, accurately estimating the binding affinity between a candidate ligand and its protein receptor is a central challenge. Recent advances in artificial intelligence, particularly deep learning, have demonstrated superior performance over traditional empirical and physics-based methods for this task, enabled by the growing availability of structural and experimental affinity data. In this work, we introduce DeepGGL, a deep convolutional neural network that integrates residual connections and an attention mechanism within a geometric graph learning framework. By leveraging multiscale weighted colored bipartite subgraphs, DeepGGL effectively captures fine-grained atom-level interactions in protein-ligand complexes across multiple scales. We benchmarked DeepGGL against established models on CASF-2013 and CASF-2016, where it achieved state-of-the-art performance with significant improvements across diverse evaluation metrics. To further assess robustness and generalization, we tested the model on the CSAR-NRC-HiQ dataset and the PDBbind v2019 holdout set. DeepGGL consistently maintained high predictive accuracy, highlighting its adaptability and reliability for binding affinity prediction in structure-based drug discovery.

Indexed as

Deep LearningDrug DesignDrug DiscoveryProteinsGraph Neural NetworksLigandsProtein BindingLigandsProteinsAttentionDeep convolutional neural networkGeometric graph learningProtein-ligand binding affinityResidual connection

Identifiers

PMID41413775
PMCPMC12831358

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.