A density-based approach for detecting complexes in weighted PPI networks by semantic similarity

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Protein complex detection in PPI networks plays an important role in analyzing biological processes. A new algorithm-DBGPWN-is proposed for predicting complexes in PPI networks. Firstly, a method based on gene ontology is used to measure semantic similarities between interacted proteins, and the similarity values are used as their weights. Then, a density-based graph partitioning algorithm is developed to find clusters in the weighted PPI networks, and the identified ones are considered to be dense and similar. Experimental results demonstrate that our approach achieves good performance as compared with such algorithms as MCL, CMC, MCODE, RNSC, CORE, ClusterOne and FGN.

Cite

CITATION STYLE

APA

Zhou, H. F., Liu, J., Li, J. H., & Duan, W. C. (2017). A density-based approach for detecting complexes in weighted PPI networks by semantic similarity. PLoS ONE, 12(7). https://doi.org/10.1371/journal.pone.0180570

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free