ArticleJournal of pharmaceutical analysis2025
An inductive learning-based method for predicting drug-gene interactions using a multi-relational drug-disease-gene graph.
Article in Journal of pharmaceutical analysis, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
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
1 citing paper in PubMed.
- BiGvCL: bipartite graph-based cross-domain contrastive learning model for the predicting drug-gene interactions.Briefings 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
7 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Computational analysis can accurately detect drug-gene interactions (DGIs) cost-effectively. However, transductive learning models are the hotspot to reveal the promising performance for unknown DGIs (both drugs and genes are present in the training model), without special attention to the unseen DGIs (both drugs and genes are absent in the training model). In view of this, this study, for the first time, proposed an inductive learning-based model for the precise identification of unseen DGIs. In our study, by integrating disease nodes to avoid data sparsity, a multi-relational drug-disease-gene (DDG) graph was constructed to achieve effective fusion of data on DDG intro-relationships and inter-actions. Following the extraction of graph features by utilizing graph embedding algorithms, our next step was the retrieval of the attributes of individual gene and drug nodes. In this way, a hybrid feature characterization was represented by integrating graph features and node attributes. Machine learning (ML) models were built, enabling the fulfillment of transductive predictions of unknown DGIs. To realize inductive learning, this study generated an innovative idea of transforming known node vectors derived from the DDG graph into representations of unseen nodes using node similarities as weights, enabling inductive predictions for the unseen DGIs. Consequently, the final model was superior to existing models, with significant improvement in predicting both external unknown and unseen DGIs. The practical feasibility of our model was further confirmed through case study and molecular docking. In summary, this study establishes an efficient data-driven approach through the proposed modeling, suggesting its value as a promising tool for accelerating drug discovery and repurposing.
Indexed as
Identifiers
What Socratic 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 Socratic graph.