Identifying the overlapping complexes in protein interaction networks.
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.
Li
Min
M
School of Information Science and Engineering, Central South University, Changsha 410083, China. limin@mail.csu.edu.cn
Wang
Jianxin
J
Chen
Jianer
J
Cai
Zhao
Z
Chen
Gang
G
D019295:Computational Biology / Q000379:methods*; D030562:Databases, Protein; D025941:Protein Interaction Mapping / Q000379:methods*; D011506:Proteins / Q000737:chemistry* / Q000378:metabolism*; D012441:Saccharomyces cerevisiae / Q000737:chemistry / Q000378:metabolism
D011506:Proteins