A density-based approach for detecting complexes in weighted PPI networks by semantic similarity.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 28704455.
- Also identified by DOI 10.1371/journal.pone.0180570 and PMC identifier 5507511.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.
Medical subject headings
- Protein Interaction Mapping
- Semantics