Author： Li Min Wang Jianxin Chen Jianer Cai Zhao Chen Gang
Publisher： Inderscience Publishers
ISSN： 1748-5673
Source： International Journal of Data Mining and Bioinformatics, Vol.4, Iss.1, 2010-01, pp. : 91-108
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Access to resources
Recommend
By Zhang Shihua Liu Hong-Wei Ning Xue-Mei Zhang Xiang-Sun
International Journal of Data Mining and Bioinformatics, Vol. 3, Iss. 1, 2009-03 ,pp. :
An analysis pipeline for the inference of protein-protein interaction networks
By Taylor Ronald C. Singhal Mudita Daly Don S. Gilmore Jason Cannon William R. Domico Kelly White Amanda M. Auberry Deanna L. Auberry Kenneth J. Hooker Brian S. Hurst Greg McDermott Jason E. McDonald W. Hayes Pelletier Dale A. Schmoyer Denise Wiley H. Steven
International Journal of Data Mining and Bioinformatics, Vol. 3, Iss. 4, 2009-11 ,pp. :
Finding Pathway Structures in Protein Interaction Networks
By Lu Songjian Zhang Fenghui Chen Jianer Sze Sing-Hoi
Algorithmica, Vol. 48, Iss. 4, 2007-08 ,pp. :