Identifying the overlapping complexes in protein interaction networks
by Min Li, Jianxin Wang, Jianer Chen, Zhao Cai, Gang Chen
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 4, No. 1, 2010

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.

Online publication date: Thu, 14-Jan-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com