Evidence map›Paper›PMID 42691127›Full record

ArticlePLoS computational biology2026

PCIPG: A comprehensive framework for protein complex identification based on a probabilistic graphical model.

Yixiang Huang, Lei Yang, Jiudong Wang, Xinqi Gong

Abstract read
In one paragraph

Article in PLoS computational biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Yixiang HuangSchool of Mathematics, Renmin University of China, Beijing, China.
Lei YangSchool of Mathematics, Renmin University of China, Beijing, China.
Jiudong WangSchool of Life Science, Beijing Institute of Technology, Beijing, China.
Xinqi GongSchool of Mathematics, Renmin University of China, Beijing, China.ORCID 0000-0003-2802-6176

Funding

Big Data and Responsible Artificial Intelligence for National Governance, Renmin University of ChinaNational Key Research and Development Program of ChinaNational Natural Science Foundation of ChinaRenmin University of China ‘Qiushi Academic’ Education and Talent Development Program—Qiushi Academic Dongliang ProjectShenzhen Medical Research FundStrategic Scientist Leadership Program, Renmin University of Chinathe Public Computing Cloud, Renmin University of China
6 · The paper itself

Abstract

Protein complexes are molecular machines that execute essential cellular functions, but their computational identification remains challenging. Existing protein complex identification methods largely rely on PPI network topology, functional annotations, or protein-level biochemical evidence. Although these approaches have recovered many biologically meaningful assemblies, they are often sensitive to incomplete or noisy interactomes and provide limited mechanistic insight into the residue- and interface-level determinants of complex formation. In particular, conventional PPI-based graph representations indicate whether proteins are associated, but usually ignore how protein subunits physically interact through spatially organized residues and structural interfaces. These limitations motivate the development of computational frameworks that connect residue-scale structural cues with interactome-scale organization. Here we present PCIPG, a multi-scale probabilistic graph framework that jointly models residues, proteins, interactions and complexes. PCIPG encodes residue-level physicochemical descriptors on intra-chain contact maps, screens informative residues to construct structure-aware protein representations and propagates these representations over the PPI graph to infer a protein-complex membership matrix. To couple complex membership with sparse interaction evidence, PCIPG reconstructs the network using a zero-inflated Bernoulli-Exponential likelihood, providing a principled learning signal under missing-edge and noise regimes. Across five Saccharomyces cerevisiae benchmarks, PCIPG achieved higher average F1 and Acc than the representative baseline methods included in this study, with average improvements of 11.46% and 3.64%, respectively. On the evaluated human interactomes, PCIPG achieved the highest F1 score among the compared methods on HCT116 and HEK293T, whereas its performance on HuRI was below that of AdaPPI and ClusterONE. Embedding-guided interaction completion improved PCIPG's performance relative to its results on the corresponding original human PPI networks. Beyond complex calling, PCIPG supports core-module mining by recovering known cores and delineating coherent accessory modules within assemblies; several predictions match previously reported functional entities, including TRAPPII- and PCNA-loading-factor-related complexes. At the residue level, residues prioritized by PCIPG show increased overlap with experimentally defined protein-binding interfaces in the evaluated structures. In a computational CFTR case study, the model generated state-dependent interaction predictions that partially overlapped with experimentally profiled wild-type and ΔF508 interaction networks. Together, PCIPG bridges residue-scale structural cues with interactome-scale organization to enable interpretable and scalable protein complex identification. Code and data are available at https://github.com/hyx-1/PCIPG.

Indexed as

Computational BiologyModels, StatisticalMultiprotein ComplexesProtein Interaction MappingProteinsAlgorithmsComputer GraphicsDatabases, ProteinHumansProtein Interaction MapsMultiprotein ComplexesProteins

Identifiers

PMID42691127
PMCPMC13577533

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

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.