ArticleBMC bioinformatics2023
Molecular complex detection in protein interaction networks through reinforcement learning.
Article in BMC bioinformatics, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 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
10 citing papers in PubMed, 19 citations in OpenAlex.
- Engineering a protein homodimer from a heterodimer: A chimeric DBHS protein.Protein science : a publication of the Protein Society · 2026Article
- Graph and Hypergraph Theories Applied to Dynamic Protein-Protein Interaction Network Analysis, and Deep-Learning Frameworks for Protein Complex Network Prediction.International journal of molecular sciences · 2026Review
- Comparative Proteomic Profiling of Responses to Standard Systemic Treatment Regimens in Pancreatic Cancer.Cells · 2026Article
- Network pharmacology and molecular simulation reveal the entourage effect mechanisms of psilocybin-producing mushrooms on the brain.Scientific reports · 2026Article
- Challenges and Opportunities in Multi-Omics Data Acquisition and Analysis: Toward Integrative Solutions.Biomolecules · 2026Review
- RNase MRP subunit composition and role in 40S ribosome biogenesis.Nature structural & molecular biology · 2026Article
- Sensitivity analysis on protein-protein interaction networks through deep graph networks.BMC bioinformatics · 2025Article
- FBN2 promotes the proliferation, mineralization, and differentiation of osteoblasts to accelerate fracture healing.Scientific reports · 2025Article
- NHSL3 controls single and collective cell migration through two distinct mechanisms.Nature communications · 2025Article
- Revolutionizing Molecular Design for Innovative Therapeutic Applications through Artificial Intelligence.Molecules (Basel, Switzerland) · 2024Review
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 at 1 institution in 1 country.
Funding
Abstract
backgroundProteins often 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 include unsupervised and supervised approaches, often assuming that protein complexes manifest only as dense subgraphs. Utilizing supervised approaches, the focus is not on how to find them in a network, but only on learning which subgraphs correspond to complexes, currently solved using heuristics. However, learning to walk trajectories on a network to identify protein complexes leads naturally to a reinforcement learning (RL) approach, a strategy not extensively explored for community detection. Here, we develop and evaluate a reinforcement learning pipeline for community detection on weighted protein-protein interaction networks to detect new protein complexes. The algorithm is trained to calculate the value of different subgraphs encountered while walking on the network to reconstruct known complexes. A distributed prediction algorithm then scales the RL pipeline to search for novel protein complexes on large PPI networks.
resultsThe reinforcement learning pipeline is applied to a human PPI network consisting of 8k proteins and 60k PPI, which results in 1,157 protein complexes. The method demonstrated competitive accuracy with improved speed compared to previous algorithms. We highlight protein complexes such as C4orf19, C18orf21, and KIAA1522 which are currently minimally characterized. Additionally, the results suggest TMC04 be a putative additional subunit of the KICSTOR complex and confirm the involvement of C15orf41 in a higher-order complex with HIRA, CDAN1, ASF1A, and by 3D structural modeling.
conclusionsReinforcement learning offers several distinct advantages for community detection, including scalability and knowledge of the walk trajectories defining those communities. Applied to currently available human protein interaction networks, this method had comparable accuracy with other algorithms and notable savings in computational time, and in turn, led to clear predictions of protein function and interactions for several uncharacterized human proteins.
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.