An algorithm for identifying protein complexes based on clique percolation and distance restriction.

Identification of protein complexes in large interaction networks is crucial to understand principles of cellular organization and predict protein functions, which is one of the most important issues in the post-genomic era. Each protein might subordinate multiple protein complexes in the real protein-protein interaction networks. Identifying overlapping protein complexes front protein-protein interaction networks is a considerable research topic. As an effective algorithm on identifying overlapping module structures, clique percolation method (CPM) has a wide range of application in social networks and biological networks. However, CPM algorithm is recognition accuracy rate lowly and unfit to identifying protein complexes with middling scale when it applied in PPI networks. In this paper, an algorithm called CPM-DR for identifying protein complexes based on clique percolation and distance restriction is proposed. In this algorithm, the scale of protein complex is restricted by distance constraint to conquest the drawbacks in CPM. The experiment results show that CPM-DR algorithm can identify many well known protein complexes more effectively, precisely and comprehensively. [ABSTRACT FROM AUTHOR]