Title: Identifying the overlapping complexes in protein interaction networks

Authors: Min Li, Jianxin Wang, Jianer Chen, Zhao Cai, Gang Chen

Addresses: 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

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.

Keywords: protein interaction networks; protein complexes; graph; dense sub-graph; maximal clique; protein functions; protein sequences; bioinformatics.

DOI: 10.1504/IJDMB.2010.030969

International Journal of Data Mining and Bioinformatics, 2010 Vol.4 No.1, pp.91 - 108

Received: 15 Sep 2007
Accepted: 28 Jul 2008
Published online: 14 Jan 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article