ArticleBriefings in bioinformatics2025
NASNet-DTI: accurate drug-target interaction prediction using heterogeneous graphs and node adaptation.
Article in Briefings in bioinformatics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.
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.
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.
Who cites it
5 citing papers in PubMed.
- How Advanced Artificial Intelligence Technologies Shape Drug-Drug and Drug-Target Interaction Modeling.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2026Review
- Graph-based drug-target interaction modeling: from representation learning to output-driven drug discovery.Briefings in bioinformatics · 2026Review
- A Node-Adaptive Feature Fusion Network for Drug-Target Interaction Prediction Based on Multi-View Graphs.Biomolecules · 2026Article
- UGP system: A deep learning-driven platform for automated identification of ultrafine granular powders using chromatographic fingerprinting.Journal of pharmaceutical analysis · 2026Article
- LNMGAT: a laplacian regularized pseudo-negative mining graph attention network for robust drug-target interaction prediction under multi-scenario cold-start settings.Frontiers in bioinformatics · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
Drug-target interactions (DTIs) play a key role in drug development, and accurate prediction can significantly improve the efficiency of this process. Traditional experimental methods are reliable but time-consuming and laborious. With the rapid development of deep learning, many DTI prediction methods have emerged. However, most of these methods only focus on the intrinsic features of drugs and targets, while ignoring the relational features between them. In addition, existing graph-based DTI prediction methods often face the challenge of over-smoothing in graph neural networks (GNNs), which limits their prediction accuracy. To address these issues, we propose NASNet-DTI (Drug-target Interactions Based on Node Adaptation and Similarity Networks), a new framework designed to overcome these limitations. NASNet-DTI uses graph convolutional network to extract features from drug molecules and targets separately, and constructs heterogeneous networks to represent two types of nodes: drugs and targets. The edges in the network describe their multiple relationships: drug-drug, target-target, and drug-target. In the feature learning stage, NASNet-DTI adopts a node adaptive learning strategy to dynamically determine the optimal aggregation depth for each node. This ensures that each node can learn the most discriminative features, which effectively alleviates the over-smoothing problem and improves prediction accuracy. Experimental results show that NASNet-DTI significantly outperforms existing methods on multiple datasets, demonstrating its effectiveness and potential as a powerful tool to advance drug discovery and development.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.