基于极大团扩展的蛋白质复合物识别算法 - 中南大学学报.pdfVIP

41 2 () Vol.41 No.2 2010 4 Journal of Central South University (Science and Technology) Apr. 2010 ( 410083) CFinder (IPC-MCE) CFinder IPC-MCE IPC-MCE CFinder 2 IPC-MCE TP 391.41 A 1672−7207(2010)02−0560−06 An algorithm for identifying protein complexes based on maximal clique extension LI Min, WANG Jian-xin, LIU Bin-bin, CHEN Jian-er (School of Information Science and Engineering, Central South University, Changsha 410083, China) Abstract: A new algorithm for identifying protein complexes based on maximal clique extension (IPC-MCE) was proposed to avoid the drawback where unexpected huge protein complexes were generated by the tool of CFinder. The maximal clique was regarded as the core of protein complex. Whether a neighborhood of the core could be added to the protein complex was determined by the interaction probability. The IPC-MCE algorithm was applied on the yeast protein-protein interaction network. The comparison results indicate that the algorithm IPC-MCE identifies protein complexes more accurately than the tool of CFinder does. The number of known protein complexes matched by the algorithm IPC-MCE is twice more than the number of that matched by the tool of CFinder under their optimum parameters. Thus, the algorithm IPC-MCE is more effective for identifying protein complexes. Key words: protein-protein interaction network; protein complexes; graph mining; maximal clique