Identifying the overlapping complexes in protein interaction networks. Academic Article

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.

authors

• Chen, Jianer

published proceedings

• Int J Data Min Bioinform

author list (cited authors)

• Li, M., Wang, J., Chen, J., Cai, Z., & Chen, G.

citation count

• 27

complete list of authors

• Li, Min||Wang, Jianxin||Chen, Jianer||Cai, Zhao||Chen, Gang

publication date

• January 2010

publisher

• Inderscience Publishers  Publisher

published in

• International Journal of Data Mining and Bioinformatics  Journal

keywords

• Computational Biology
• Databases, Protein
• Protein Interaction Mapping
• Proteins
• Saccharomyces Cerevisiae

PubMed Central ID

• 20376924

Digital Object Identifier (DOI)

• 10.1504/ijdmb.2010.030969

start page

• 91

end page

• 108

volume

• 4

issue

• 1

URL

• http://dx.doi.org/10.1504/ijdmb.2010.030969