摘要

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.

全文