English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  PC2P: parameter-free network-based prediction of protein complexes

Omranian, N., Angeleska, A., & Nikoloski, Z. (2021). PC2P: parameter-free network-based prediction of protein complexes. Bioinformatics, 10: 1240. doi:10.1093/bioinformatics/btaa1089.

Item is

Basic

show hide
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Omranian, N.1, Author              
Angeleska, Angela2, Author
Nikoloski, Z.1, Author              
Affiliations:
1Mathematical Modelling and Systems Biology - Nikoloski, Cooperative Research Groups, Max Planck Institute of Molecular Plant Physiology, Max Planck Society, ou_1753310              
2external, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: Prediction of protein complexes from protein–protein interaction (PPI) networks is an important problem in systems biology, as they control different cellular functions. The existing solutions employ algorithms for network community detection that identify dense subgraphs in PPI networks. However, gold standards in yeast and human indicate that protein complexes can also induce sparse subgraphs, introducing further challenges in protein complex prediction.To address this issue, we formalize protein complexes as biclique spanned subgraphs, which include both sparse and dense subgraphs. We then cast the problem of protein complex prediction as a network partitioning into biclique spanned subgraphs with removal of minimum number of edges, called coherent partition. Since finding a coherent partition is a computationally intractable problem, we devise a parameter-free greedy approximation algorithm, termed Protein Complexes from Coherent Partition (PC2P), based on key properties of biclique spanned subgraphs. Through comparison with nine contenders, we demonstrate that PC2P: (i) successfully identifies modular structure in networks, as a prerequisite for protein complex prediction, (ii) outperforms the existing solutions with respect to a composite score of five performance measures on 75% and 100% of the analyzed PPI networks and gold standards in yeast and human, respectively, and (iii,iv) does not compromise GO semantic similarity and enrichment score of the predicted protein complexes. Therefore, our study demonstrates that clustering of networks in terms of biclique spanned subgraphs is a promising framework for detection of complexes in PPI networks.https://github.com/SaraOmranian/PC2P.Supplementary data are available at Bioinformatics online.

Details

show
hide
Language(s): eng - English
 Dates: 2021-01
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1093/bioinformatics/btaa1089
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Bioinformatics
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Oxford : Oxford University Press
Pages: - Volume / Issue: 10 Sequence Number: 1240 Start / End Page: - Identifier: ISSN: 1367-4803
CoNE: https://pure.mpg.de/cone/journals/resource/954926969991