Search bioRxiv⌕ Search
Home/Archive/bioRxiv

bioRxiv · 10.1101/521161

GuiltyTargets: Prioritization of Novel Therapeutic Targets with Deep Network Representation Learning

Muslu, O.·Hoyt, C. T.·Hofmann-Apitius, M.·Froehlich, H.
View original source ↗Export metadata ↓

Abstract

The majority of clinical trial failures are caused by low efficacy of investigated drugs, often due to a poor choice of target protein. Computational prioritization approaches aim to support target selection by ranking candidate targets in the context of a given disease. We propose a novel target prioritization approach, GuiltyTargets, which relies on deep network representation learning of a genome-wide protein-protein interaction network annotated with disease-specific differential gene expression and uses positive-unlabeled machine learning for candidate ranking. We evaluated our approach on six diseases of different types (cancer, metabolic, neurodegenerative) within a 10 times repeated 5-fold stratified cross-validation and achieved AUROC values between 0.92 - 0.94, significantly outperforming a previous approach, which relies on manually engineered topological features. Moreover, we showed that GuiltyTargets allows for target repositioning across related disease areas. Applying GuiltyTargets to Alzheimers disease resulted into a number of highly ranked candidates that are currently discussed as targets in the literature. Interestingly, one (COMT) is also the target of an approved drug (Tolcapone) for Parkinsons disease, highlighting the potential for target repositioning of our method.\n\nAvailabilityThe GuiltyTargets Python package is available on PyPI and all code used for analysis can be found under the MIT License at https://github.com/GuiltyTargets.\n\nAuthor summaryMany drug candidates fail in clinical trials due to low efficacy. One of the reasons is the choice of the wrong target protein, i.e. perturbation of the protein does not effectively modulate the disease phenotype on a molecular level. In consequence many patients do not demonstrate a clear response to the drug candidate. Traditionally, targets are selected based on evidence from the literature and follow-up experiments. However, this process is very labor intensive and often biased by subjective choices. Computational tools could help a more rational and unbiased choice of target proteins and thus increase the chance of drug discovery programs. In this work we propose a novel machine learning based method for target candidate ranking. The method (GuiltyTargets) captures properties of known targets to learn a ranking of candidates. GuiltyTargets compares favorably against existing machine learning based target prioritization methods and allowed us to propose novel targets for Alzheimers disease.

Source connections

Explore related subjects

bioinformaticsPreprint

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muslu, O., Hoyt, C. T., Hofmann-Apitius, M., Froehlich, H.. 2019-01-16. GuiltyTargets: Prioritization of Novel Therapeutic Targets with Deep Network Representation Learning. https://doi.org/10.1101/521161

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

bioRxiv2026

RoDPAA: A Robust Dissimilarity-Based Principal Angle Analysis Framework for Multi-View Microbiome Data Integration

Multiview microbiome studies profile the same participants across body sites or molecular layers, but integration is hampered by sparse, compositional data, modest sample sizes and methods that recognize only exact sharing. We present RoDPAA (Robust Dissimilarity-based Principal Angle Analysis), a framework that represents each view through any data-appropriate dissimilarity, such as Bray--Curtis, without log-ratio transformation or likelihood assumptions. RoDPAA aligns view-specific signal subspaces through principal angles, captures complete and partial sharing, and tests by permutation how many components are shared, using only eigendecomposition and little tuning. In Gaussian simulations, RoDPAA matched JIVE and MOFA given true ranks, ran faster and alone recovered the shared dimension in every replicate. In two inflammatory bowel disease (IBD) cohorts with sparse, zero-inflated data, Bray--Curtis-based RoDPAA recovered shared structure that was stable to prevalence filtering, whereas log-ratio-based alternatives were not. Its leading microbiome--metabolome factors, learned without disease labels, were the only ones associated with IBD.

bioinformatics↗
bioRxiv2026

Deducing splicing events from transcript sets with splicelogic

Long-read RNA sequencing captures a greater proportion of full-length transcripts, enabling more accurate isoform identification, discovery of novel isoforms, and more precise differential transcript usage analysis. However, comparing transcripts, whether between conditions or between sets such as novel and annotated isoforms, yields complex isoform changes that are hard to manipulate, summarize, and visualize. This is compounded by vertical integration of some tools, where downstream analysis depends on the specific output of a particular upstream tool. To address this gap, we have developed splicelogic, an R/Bioconductor package that makes transcript-set comparisons biologically interpretable by turning them into discrete splicing events, such as exon skipping, alternative splice sites, intron retention, and alternative transcription start and end sites. We designed splicelogic to integrate easily with existing RNA-seq workflows and tools. The splicelogic functions are modular, readable, and extensible, making it easy for users to adapt core logic to their own custom scientific questions or novel splicing definitions. By obtaining interpretable splicing events from transcript changes, splicelogic enables downstream analyses, including annotation of RNA-binding protein recognition sites, alongside summary statistics and visualization. The splicelogic package is publicly available and distributed through Bioconductor.

bioinformatics↗
bioRxiv2026

Contrastive Learning Improves Generalization on M2OR Olfactory Binding Dataset

Olfaction-based biosensors stand to have profound impacts in fields such as medical diagnostics, national security, and drug discovery. A promising mode of vapor phase biodetection mimics volatile organic compound-olfactory receptor (VOC-OR) interactions with target-specific protein or peptide probes; however, lack of experimental coverage remains a core bottleneck. Current computational approaches aim to improve prediction of VOC-OR binding to reduce experimental burden, and current machine learning approaches fail to demonstrate a level of generalization that addresses current engineering challenges. Here, using the Molecular to Olfactory Dataset (M2OR) and Insect Olfactory Binding Protein Database (iOBPdb) datasets, data partitioning methods and their performance are evaluated on a neural network and contrastive learning framework on such VOC-OR binding datasets, varying: model training, architecture, and structure of the input data distribution. It was found that holding out certain chemical or proteomic motifs from the training data diminished model performance with a two layer neural network model. The model was able to generalize to state of the art performance (0.88 AUCROC) on every data split by applying a contrastive learning objective defined by shared molecular constituents and a stochastic sampler. This suggests the contrastive objective provides a strong inductive bias for neural networks to predict novel VOC-OR pairs. These findings highlight that model performance on pairwise biological interaction datasets can be inflated through identity leakage from constituent overlap, and emphasize the need for more robust evaluation protocols. Furthermore, we show contrastive regularization mitigates dataset degeneracy through enforcement of compatibility in the models latent geometry that may extend to other binder target-datasets where identity leakage confounds evaluation.

bioinformatics↗