Identifying the overlapping complexes in protein interaction networks

  • Authors:
  • Min Li;Jianxin Wang;Jianer Chen;Zhao Cai;Gang Chen

  • Affiliations:
  • School of Information Science and Engineering, Central South University, Changsha 410083, China.;School of Information Science and Engineering, Central South University, Changsha 410083, China.;School of Information Science and Engineering, Central South University, Changsha 410083, China.;School of Information Science and Engineering, Central South University, Changsha 410083, China.;School of Information Science and Engineering, Central South University, Changsha 410083, China

  • Venue:
  • International Journal of Data Mining and Bioinformatics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Identification of protein complexes in large interaction networks is crucial to understanding principles of cellular organisation and predict protein functions. In this paper, a new algorithm of Identifying Protein Complexes based on Maximal Clique Extension (IPC-MCE) is proposed. The maximal clique is considered as the core of the protein complex. Proteins in a complex are classed into core vertices and peripheral vertices. The relation between the core vertices and peripheral vertices is measured by the Interaction Probability. The algorithm IPC-MCE is applied to the protein interaction network of Saccharomyces cerevisiae. Many well-known protein complexes are detected.