ClusterM: a scalable algorithm for computational prediction of conserved protein complexes across multiple protein...

Area of Science:

• Computational Biology
• Bioinformatics
• Systems Biology

Background:

• Current computational methods for identifying conserved protein complexes across multiple Protein-Protein Interaction (PPI) networks lack explicit modeling of topological properties and scalability.
• Existing algorithms struggle with the computational complexity that increases exponentially with the number of PPI networks analyzed.

Purpose of the Study:

• To propose a scalable algorithm, ClusterM, for identifying conserved protein complexes across multiple PPI networks.
• To integrate network topology and protein sequence similarity for improved conserved complex detection.
• To overcome the scalability and explicit topological property modeling limitations of previous methods.

Main Methods:

• Developed ClusterM, a scalable algorithm that integrates network topology and protein sequence similarity.
• Applied ClusterM to two independent compendiums of PPI networks from Saccharomyces cerevisiae, Drosophila melanogaster, Caenorhabditis elegans, and Homo sapiens.
• Evaluated ClusterM against state-of-the-art algorithms.

Main Results:

• ClusterM demonstrates superior performance compared to existing algorithms in identifying conserved protein complexes.
• The algorithm successfully detects conserved complexes with both topological separability and cohesive protein sequence conservation.
• ClusterM identified de novo conserved protein complexes across four species that were previously missed by other algorithms.

Conclusions:

• ClusterM effectively captures the topological property of conserved protein complexes: dense internal connectivity and separation from the rest of the network.
• The algorithm is highly scalable and efficient for analyzing multiple PPI networks.
• ClusterM offers an improved approach for discovering conserved protein complexes across diverse species.