Molecular & Cellular ProteomicsBioinformaticsPeer-reviewed journal article
On the robustness of graph-based clustering to random network alterations
Richard Greg StaceyiD, Michael A. SkinnideriD, Leonard J. FosteriD
Abstract
Biological functions emerge from complex and dynamic networks of protein-protein interactions. Because these protein-protein interaction networks, or interactomes, represent pairwise connections within a hierarchically organized system, it is often useful to identify higher-order associations embedded within them, such as multi-member protein-complexes. Graph-based clustering techniques are widely used to accomplish this goal, and dozens of field-specific and general clustering algorithms exist. However, interactomes can be prone to errors, especially interactomes that infer interactions using high-throughput biochemical assays. Therefore, robustness to network-level variability is an important criterion for any clustering algorithm that aims to generate robust, reproducible clusters. Here, we tested the robustness of a range of graph-based clustering algorithms in the presence of network-level noise, including algorithms common across domains and those specific to protein networks. We found that the results of all clustering algorithms measured were profoundly sensitive to injected network noise. Randomly rewiring 1% of network edges yielded up to a 57% change in clustering results, indicating that clustering markedly amplified network-level noise. However, the impact of network noise on individual clusters was not uniform. We found that some clusters were consistently robust to injected network noise while others were not. Therefore, we developed the clust.perturb R package and Shiny web application, which measures the reproducibility of clusters by randomly perturbing the network. We show that clust.perturb results are predictive of real-world cluster stability: poorly reproducible clusters as identified by clust.perturb are significantly less likely to be reclustered across experiments. We conclude that quantifying the robustness of a cluster to network noise, as implemented in clust.perturb, provides a powerful tool for ranking the reproducibility of clusters, and separating stable protein complexes from spurious associations.
- assay: protein structure
- research focus: benchmarking
- research focus: clustering
- approach: statistical model
- approach: simulation
- Citations
- 11
- FWCI
- 0.65
- Field percentile
- top 37%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Refining modules to determine functionally significant clusters in molecular networks
Rama Kaalia, Jagath Chandana Rajapakse·BMC GenomicsPeer-reviewed·Dec 1, 2019
- Protein complex prediction for large protein protein interaction networks with the Core&Peel Method
Marco Pellegrini, Miriam Baglioni, Filippo Geraci·bioRxiv·May 17, 2016
- Measuring rank robustness in scored protein interaction networks
Lyuba V. Bozhilova, Alan V. Whitmore, … Charlotte Mary Deane·BMC BioinformaticsPeer-reviewed·Aug 28, 2019
- BoCluSt: bootstrap clustering stability algorithm for community detection in networks
Carlos Garcia·bioRxiv·Sep 2, 2014
- Identifying Protein Complexes in Protein-protein Interaction Data using Graph Convolution Network
Nazar Zaki, Harsh Singh, Elfadil Abdalla Mohamed·IEEE AccessPeer-reviewed·Jan 1, 2021
- Handling Noise in Protein Interaction Networks
Fernanda Brito Correia, Edgar D. Coelho, … Joel Perdiz Arrais·BioMed Research InternationalPeer-reviewed·Oct 30, 2019