关键词: computer application, protein interaction network, protein complex, clustering algorithm

Abstract:

The number of known complexes recalled by the existing algorithms of clustering in proteinprotein interaction network is very limited. To solve this problem, a new distance measurebased algorithm for identification of protein complexes, named IPCDM, is proposed based on our discovery that most of the shortest paths between proteins complexes are no more than two. A new seedextension model is also proposed to improve the precision of protein complexes discovery. Experiment results on yeast protein interaction network show that more known protein complexes are recalled by IPCDM than by other typical algorithms: MCODE, ENSC, CFinder, LCMA and DPClus.

Key words: computer application, protein interaction network, protein complex, clustering algorithm