Core and peripheral connectivity based cluster analysis over PPI network

被引:14
作者
Ahmed, Hasin A. [1 ]
Bhattacharyya, Dhruba K. [1 ]
Kalita, Jugal K. [2 ]
机构
[1] Tezpur Univ, Sonitpur, Assam, India
[2] Univ Colorado, Colorado Springs, CO 80907 USA
关键词
Protein-protein interaction network; Biological network; Clustering; Protein complex; OVERLAPPING PROTEIN COMPLEXES; PHYSICAL INTERACTOME; FUNCTIONAL MODULES; MAP; ANNOTATION; PREDICTION; MODEL;
D O I
10.1016/j.compbiolchem.2015.08.008
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
A number of methods have been proposed in the literature of protein-protein interaction (PPI) network analysis for detection of clusters in the network. Clusters are identified by these methods using various graph theoretic criteria. Most of these methods have been found time consuming due to involvement of preprocessing and post processing tasks. In addition, they do not achieve high precision and recall consistently and simultaneously. Moreover, the existing methods do not employ the idea of core-periphery structural pattern of protein complexes effectively to extract clusters. In this paper, we introduce a clustering method named CPCA based on a recent observation by researchers that a protein complex in a PPI network is arranged as a relatively dense core region and additional proteins weakly connected to the core. CPCA uses two connectivity criterion functions to identify core and peripheral regions of the cluster. To locate initial node of a cluster we introduce a measure called DNQ(Degree based Neighborhood Qualification) index that evaluates tendency of the node to be part of a:cluster. CPCA performs well when compared with well-known counterparts. Along with protein complex gold standards, a co-localization dataset has also been used for validation of the results. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:32 / 41
页数:10
相关论文
共 52 条
  • [1] CFinder:: locating cliques and overlapping modules in biological networks
    Adamcsek, B
    Palla, G
    Farkas, IJ
    Derényi, I
    Vicsek, T
    [J]. BIOINFORMATICS, 2006, 22 (08) : 1021 - 1023
  • [2] Comparative interactomics with Funcoup 2.0
    Alexeyenko, Andrey
    Schmitt, Thomas
    Tjarnberg, Andreas
    Guala, Dmitri
    Frings, Oliver
    Sonnhammer, Erik L. L.
    [J]. NUCLEIC ACIDS RESEARCH, 2012, 40 (D1) : D821 - D828
  • [3] An automated method for finding molecular complexes in large protein interaction networks
    Bader, GD
    Hogue, CW
    [J]. BMC BIOINFORMATICS, 2003, 4 (1)
  • [4] Bader GD, 2003, NUCLEIC ACIDS RES, V31, P248, DOI 10.1093/nar/gkg056
  • [5] Evaluation of clustering algorithms for protein-protein interaction networks
    Brohee, Sylvain
    van Helden, Jacques
    [J]. BMC BIOINFORMATICS, 2006, 7 (1)
  • [6] Toward a comprehensive atlas of the physical interactome of Saccharomyces cerevisiae
    Collins, Sean R.
    Kemmeren, Patrick
    Zhao, Xue-Chu
    Greenblatt, Jack F.
    Spencer, Forrest
    Holstege, Frank C. P.
    Weissman, Jonathan S.
    Krogan, Nevan J.
    [J]. MOLECULAR & CELLULAR PROTEOMICS, 2007, 6 (03) : 439 - 450
  • [7] YPD™, PombePD™ and WormPD™:: model organism volumes of the BioKnowledge™ Library, an integrated resource for protein information
    Costanzo, MC
    Crawford, ME
    Hirschman, JE
    Kranz, JE
    Olsen, P
    Robertson, LS
    Skrzypek, MS
    Braun, BR
    Hopkins, KL
    Kondu, P
    Lengieza, C
    Lew-Smith, JE
    Tillberg, M
    Garrels, JI
    [J]. NUCLEIC ACIDS RESEARCH, 2001, 29 (01) : 75 - 79
  • [8] Della Rossa F., 2013, SCI REPORTS
  • [9] Dongen SMv, 2000, Graph clustering by flow simulation
  • [10] Clustering by passing messages between data points
    Frey, Brendan J.
    Dueck, Delbert
    [J]. SCIENCE, 2007, 315 (5814) : 972 - 976