title: Predicting overlapping protein complexes from weighted protein interaction graphs by gradually expanding dense neighborhoods.
abstract: Proteins are vital biological molecules driving many fundamental cellular processes. They rarely act alone, but form interacting groups called protein complexes. The study of protein complexes is a key goal in systems biology. Recently, large protein-protein interaction (PPI) datasets have been published and a plethora of computational methods that provide new ideas for the prediction of protein complexes have been implemented. However, most of the methods suffer from two major limitations: First, they do not account for proteins participating in multiple functions and second, they are unable to handle weighted PPI graphs. Moreover, the problem remains open as existing algorithms and tools are insufficient in terms of predictive metrics.
  
  
  
  In the present paper, we propose gradually expanding neighborhoods with adjustment (GENA), a new algorithm that gradually expands neighborhoods in a graph starting from highly informative "seed" nodes. GENA considers proteins as multifunctional molecules allowing them to participate in more than one protein complex. In addition, GENA accepts weighted PPI graphs by using a weighted evaluation function for each cluster.
  
  
  
  In experiments with datasets from Saccharomyces cerevisiae and human, GENA outperformed Markov clustering, restricted neighborhood search and clustering with overlapping neighborhood expansion, three state-of-the-art methods for computationally predicting protein complexes. Seven PPI networks and seven evaluation datasets were used in total. GENA outperformed existing methods in 16 out of 18 experiments achieving an average improvement of 5.5% when the maximum matching ratio metric was used. Our method was able to discover functionally homogeneous protein clusters and uncover important network modules in a Parkinson expression dataset. When used on the human networks, around 47% of the detected clusters were enriched in gene ontology (GO) terms with depth higher than five in the GO hierarchy.
  
  
  
  In the present manuscript, we introduce a new method for the computational prediction of protein complexes by making the realistic assumption that proteins participate in multiple protein complexes and cellular functions. Our method can detect accurate and functionally homogeneous clusters.
authors: InSyBio Ltd, 109 Uxbridge Road, W5 5TL London, UK. Electronic address: c.dimitrakopoulos@insybio.com.
authors: Christos
authors: C
authors: Dimitrakopoulos
authors: InSyBio Ltd, 109 Uxbridge Road, W5 5TL London, UK. Electronic address: k.theofilatos@insybio.com.
authors: Konstantinos
authors: K
authors: Theofilatos
authors: Department of Computer Engineering and Informatics, University of Patras, Building B University Campus, Rio, 26500, Greece. Electronic address: pegkas@ceid.upatras.gr.
authors: Andreas
authors: A
authors: Pegkas
authors: InSyBio Ltd, 109 Uxbridge Road, W5 5TL London, UK; Department of Computer Engineering and Informatics, University of Patras, Building B University Campus, Rio, 26500, Greece. Electronic address: likothan@ceid.upatras.gr.
authors: Spiros
authors: S
authors: Likothanassis
authors: InSyBio Ltd, 109 Uxbridge Road, W5 5TL London, UK; Department of Computer Engineering and Informatics, University of Patras, Building B University Campus, Rio, 26500, Greece; Department of Social Work, School of Sciences of Health and Care, Technological Educational Institute of Western Greece, Megalou Aleksandrou 1, Koukouli, 26334 Patra, Greece. Electronic address: mavroudi@ceid.upatras.gr.
authors: Seferina
authors: S
authors: Mavroudi
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology; D006801:Humans; D025941:Protein Interaction Mapping; D060066:Protein Interaction Maps; D012441:Saccharomyces cerevisiae
keywords: Clustering of protein–protein interaction networks; Computational prediction of protein complexes; Functionally homogeneous protein clusters; Parkinson differentially expressed network modules