ArticleMolecules (Basel, Switzerland)2018
Detection of Protein Complexes Based on Penalized Matrix Decomposition in a Sparse Protein⁻Protein Interaction Network.
Article in Molecules (Basel, Switzerland), 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 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
6 citing papers in PubMed.
- Micro-functional protein complexes mining in biological intelligent computing: a weighted network approach.BMC bioinformatics · 2026Article
- A multi-objective evolutionary algorithm for detecting protein complexes in PPI networks using gene ontology.Scientific reports · 2025Article
- Computational identification of protein complexes from network interactions: Present state, challenges, and the way forward.Computational and structural biotechnology journal · 2022Review
- Identifying Protein Complexes With Clear Module Structure Using Pairwise Constraints in Protein Interaction Networks.Frontiers in genetics · 2021Article
- Efficient and accurate identification of protein complexes from protein-protein interaction networks based on the clustering coefficient.Computational and structural biotechnology journal · 2021Article
- Molecular Computing and Bioinformatics.Molecules (Basel, Switzerland) · 2019Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
High-throughput technology has generated large-scale protein interaction data, which is crucial in our understanding of biological organisms. Many complex identification algorithms have been developed to determine protein complexes. However, these methods are only suitable for dense protein interaction networks, because their capabilities decrease rapidly when applied to sparse protein⁻protein interaction (PPI) networks. In this study, based on penalized matrix decomposition (
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.