Pith. sign in

REVIEW 2 cited by

HGTDP-DTA: Hybrid Graph-Transformer with Dynamic Prompt for Drug-Target Binding Affinity Prediction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.17697 v1 pith:35NKPOAZ submitted 2024-06-25 cs.LG cs.AIcs.CV

classification cs.LGcs.AIcs.CV
keywords informationpredictionstructuralaffinitydrug-targetgraphgraph-transformerhgtdp-dta
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Drug target binding affinity (DTA) is a key criterion for drug screening. Existing experimental methods are time-consuming and rely on limited structural and domain information. While learning-based methods can model sequence and structural information, they struggle to integrate contextual data and often lack comprehensive modeling of drug-target interactions. In this study, we propose a novel DTA prediction method, termed HGTDP-DTA, which utilizes dynamic prompts within a hybrid Graph-Transformer framework. Our method generates context-specific prompts for each drug-target pair, enhancing the model's ability to capture unique interactions. The introduction of prompt tuning further optimizes the prediction process by filtering out irrelevant noise and emphasizing task-relevant information, dynamically adjusting the input features of the molecular graph. The proposed hybrid Graph-Transformer architecture combines structural information from Graph Convolutional Networks (GCNs) with sequence information captured by Transformers, facilitating the interaction between global and local information. Additionally, we adopted the multi-view feature fusion method to project molecular graph views and affinity subgraph views into a common feature space, effectively combining structural and contextual information. Experiments on two widely used public datasets, Davis and KIBA, show that HGTDP-DTA outperforms state-of-the-art DTA prediction methods in both prediction performance and generalization ability.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding

    cs.CL 2025-06 conditional novelty 6.0 of 10

    ETT-CKGE replaces manual importance scoring in continual knowledge graph embedding with learned token masks, achieving competitive accuracy with much lower training time and memory.

  2. Describe Anything in Medical Images

    cs.CV 2025-05 conditional novelty 6.0 of 10

    MedDAM, a prompt-tuned DAM applied to medical images, reports 63.6% on the authors' MedDLC attribute-verification benchmark versus 50.2% for GPT-4o.

Pith tools