Various evidences have demonstrated that functional modules are overlapping and hierarchically organized in protein-protein interaction (PPI) networks. Up to now, few methods are able to identify both overlapping and hierarchical functional modules in PPI networks. In this paper, a new hierarchical clustering algorithm, called OH-PIN, is proposed based on the overlapping M_clusters, ?-module, and a new concept of clustering coefficient between two clusters. By recursively merging two clusters with the maximum clustering coefficient, OH-PIN finally assembles all M_clusters into ? -modules. Since M_clusters are overlapping, ? -modules based on them are also overlapping. Thus, OH-PIN can detect a hierarchical organization of overlapping modules by tuning the value of ?. The hierarchical organization is similar to the hierarchical organization of GO annotations and that of the known complexes in MIPS. To compare the performance of OH-PIN and other existing competing algorithms, we apply them to the yeast PPI network. The experimental results show that OH-PIN outperforms the existing algorithms in terms of the functional enrichment and matching with known protein complexes.
|Evidence ID||Analyze ID||Interactor||Interactor Systematic Name||Interactor||Interactor Systematic Name||Type||Assay||Annotation||Action||Modification||Phenotype||Source||Reference||Note|
|Evidence ID||Analyze ID||Gene||Gene Systematic Name||Gene Ontology Term||Gene Ontology Term ID||Qualifier||Aspect||Method||Evidence||Source||Assigned On||Reference||Annotation Extension|
|Evidence ID||Analyze ID||Gene||Gene Systematic Name||Phenotype||Experiment Type||Experiment Type Category||Mutant Information||Strain Background||Chemical||Details||Reference|
|Evidence ID||Analyze ID||Regulator||Regulator Systematic Name||Target||Target Systematic Name||Experiment||Conditions||Strain||Source||Reference|