Search bioRxiv⌕ Search

bioRxiv · 10.1101/2022.06.20.496772

Molecular complex detection in protein interaction networks through reinforcement learning

Abstract

Many, if not most, proteins assemble into higher-order complexes to perform their biological functions. Such protein-protein interactions (PPI) are often experimentally measured for pairs of proteins and summarized in a weighted PPI network, to which community detection algorithms can be applied to define the various higher-order protein complexes. Current methods, which include both unsupervised and supervised approaches, often assume that protein complexes manifest only as dense subgraphs, and in the case of supervised approaches, focus only on learning which subgraphs correspond to complexes, not how to find them in a network, a task that is currently solved using heuristics. However, learning to walk trajectories on a network with the goal of finding protein complexes lends itself naturally to a reinforcement learning (RL) approach, a strategy that has not been extensively explored for community detection. Here, we evaluated the use of a reinforcement learning pipeline for community detection in weighted protein-protein interaction networks to detect new protein complexes. Using known complexes, the algorithm is trained to calculate the value of different possible subgraph densities in the process of walking on the network to find a protein complex. Then, a distributed prediction algorithm scales the RL pipeline to search for protein complexes on large PPI networks. The reinforcement learning pipeline applied to a human PPI network consisting of 8k proteins and 60k PPI results in 1,157 protein complexes and shows competitive accuracy with improved speed when compared to previous algorithms. We highlight protein complexes harboring minimally characterized proteins including C4orf19, C18orf21, and KIAA1522, suggest TMC04 to be a putative additional subunit of the KICSTOR complex, and confirm the participation of C15orf41 in a higher-order complex with CDAN1, ASF1A, and HIRA by 3D structural modeling. Reinforcement learning offers several distinct advantages for community detection, including scalability and knowledge of the walk trajectories defining those communities.

Source connections

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Palukuri, M. V., Patil, R. S., Marcotte, E. M.. 2022-06-21. Molecular complex detection in protein interaction networks through reinforcement learning. https://doi.org/10.1101/2022.06.20.496772

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

KEEP EXPLORING

Related preprints

deepTools4: Faster, Scalable, and Modernized Genomic Data Analysis

The deepTools suite is widely used for quality control, summarization, and visualization of high-throughput sequencing data. However, as genomic datasets grow in scale and depth, existing tools often become computational bottlenecks. We present deepTools4, a modernized framework designed for high performance, scalability, and enhanced usability, while maintaining seamless integration with the Galaxy platform. Core functionality has been rewritten and thoroughly benchmarked, achieving substantial computational speed-ups. Visualization tools have been modernized to provide more intuitive, high-quality graphical outputs. In addition, our testing framework has been expanded to facilitate continuous development and ensure robustness. We demonstrate the utility of deepTools4 across diverse epigenomics and transcriptomics datasets, highlighting its ability to summarize genome-wide signals, apply a wide range of common normalization methods, and visualize enrichment patterns. The enhanced deepTools4 framework delivers a faster, more scalable solution for reproducible genome-wide analysis and interpretation across many sequencing modalities. Availability: https://github.com/deeptools/deepTools/

bioinformatics↗

Reproducibility and cross-dataset concordance of drug-induced transcriptional responses

Drug-perturbation transcriptomic resources are expanding, but the reproducibility and cross-source consistency of the responses they measure remain critical to their use. We compared six resources using independent replicates, matched-drug analyses, and response decomposition. High agreement in treated expression did not translate into equally repeatable drug-induced changes. Cross-source response concordance was generally limited, including under matched cell and treatment conditions, although some comparisons retained drug-specific information. In Tahoe, a control-expression-only baseline left substantial drug-specific variation unresolved. Measured drug main effects - the average responses across cell lines - provided information for predicting cell-specific interactions, with this relationship retained in a cross-plate validation. Exploratory analyses of structure, target, and external-response representations identified modest signals in selected pipelines. Together, these analyses characterize the reliability and transferability of current perturbation resources and identify prediction of drug main effects as a key bottleneck in the framework examined, motivating shared reference measurements and better recovery of drug-specific responses.

bioinformatics↗

Propensity-Adjusted AUC under Nuisance-Model Misspecification

Propensity adjustment compares medical-image detector scores within groups with similar measured properties, such as stain or focus. We examine its sensitivity to the nuisance model that forms those groups. Under Gaussian latent-index assumptions and exact linear-index strata, a closed-form correlation gives an exact boundary for adjusted AUC to fall below one half. Quadrature matches 36 simulation cells within 0.008. Inflation and attenuation relative to correct adjustment are empirical findings, not general ordering results. An overlap screen and a self-stratified control introduced for this study miss 140 of 141 simulated cells with absolute error above 0.05: checking the fitted propensity cannot certify completeness of the adjustment set. On real pathology corpora, logistic and boosted-tree models using the same 16 features disagree. Among splits where both pass both checks, mean adjusted-AUC gaps are 0.057 on acid-fast bacilli (AFB), 0.048 on Kaggle, and 0.049 on PCam, over three, five, and three splits respectively. These gaps measure model sensitivity; neither estimate is known to be correct. A controlled colour shift moves adjusted AUC relative to model-specific references in the predicted direction in 78 of 80 label-dependent cells. Broader balance and label-fit diagnostics favour trees without certifying their adjusted AUC. We recommend reporting sensitivity across nuisance models alongside these diagnostics. Reversal relative to known truth occurs in constructed stress tests; its frequency in practice remains unknown.

bioinformatics↗