ArticlePloS one2025
ISLRWR: A network diffusion algorithm for drug-target interactions prediction.
Article in PloS one, 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.
- BioMNEDR: mechanism-guided network embedding for drug repurposing.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
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Machine learning techniques and computer-aided methods are now widely used in the pre-discovery tasks of drug discovery, effectively improving the efficiency of drug development and reducing the workload and cost. In this study, we used multi-source heterogeneous network information to build a network model, learn the network topology through multiple network diffusion algorithms, and obtain compressed low-dimensional feature vectors for predicting drug-target interactions (DTIs). We applied the metropolis-hasting random walk (MHRW) algorithm to improve the performance of the random walk with restart (RWR) algorithm, forming the basis by which the self-loop probability of the current node is removed. Additionally, the propagation efficiency of the MHRW was improved using the improved metropolis-hasting random walk (IMRWR) algorithm, facilitating network deep sampling. Finally, we proposed a correction of the transfer probability of the entire network after increasing the self-loop rate of isolated nodes to form the ISLRWR algorithm. Notably, the ISLRWR algorithm improved the area under the receiver operating characteristic curve (AUROC) by 7.53 and 5.72%, and the area under the precision-recall curve (AUPRC) by 5.95 and 4.19% compared to the RWR and MHRW algorithms, respectively, in predicting DTIs performance. Moreover, after excluding the interference of homologous proteins (popular drugs or targets may lead to inflated prediction results), the ISLRWR algorithm still showed a significant performance improvement.
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.