Mining functional subgraphs from cancer protein-protein interaction networks

被引:10
作者
Shen, Ru [1 ,2 ]
Goonesekere, Nalin C. W. [3 ]
Guda, Chittibabu [1 ,4 ]
机构
[1] Univ Nebraska Med Ctr, Dept Genet Cell Biol & Anat, Omaha, NE 68198 USA
[2] SUNY Albany, Dept Comp Sci, Albany, NY 12222 USA
[3] Univ No Iowa, Dept Chem & Biochem, Cedar Falls, IA 50614 USA
[4] Univ Nebraska Med Ctr, Bioinformat & Syst Biol Core Facil, Omaha, NE 68198 USA
关键词
ALIGNMENT; DATABASE; TARGETS; MYC; P53;
D O I
10.1186/1752-0509-6-S3-S2
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: Protein-protein interaction (PPI) networks carry vital information about proteins' functions. Analysis of PPI networks associated with specific disease systems including cancer helps us in the understanding of the complex biology of diseases. Specifically, identification of similar and frequently occurring patterns (network motifs) across PPI networks will provide useful clues to better understand the biology of the diseases. Results: In this study, we developed a novel pattern-mining algorithm that detects cancer associated functional subgraphs occurring in multiple cancer PPI networks. We constructed nine cancer PPI networks using differentially expressed genes from the Oncomine dataset. From these networks we discovered frequent patterns that occur in all networks and at different size levels. Patterns are abstracted subgraphs with their nodes replaced by node cluster IDs. By using effective canonical labeling and adopting weighted adjacency matrices, we are able to perform graph isomorphism test in polynomial running time. We use a bottom-up pattern growth approach to search for patterns, which allows us to effectively reduce the search space as pattern sizes grow. Validation of the frequent common patterns using GO semantic similarity showed that the discovered subgraphs scored consistently higher than the randomly generated subgraphs at each size level. We further investigated the cancer relevance of a select set of subgraphs using literature-based evidences. Conclusion: Frequent common patterns exist in cancer PPI networks, which can be found through effective pattern mining algorithms. We believe that this work would allow us to identify functionally relevant and coherent subgraphs in cancer networks, which can be advanced to experimental validation to further our understanding of the complex biology of cancer.
引用
收藏
页数:14
相关论文
共 51 条
[1]   BASIC LOCAL ALIGNMENT SEARCH TOOL [J].
ALTSCHUL, SF ;
GISH, W ;
MILLER, W ;
MYERS, EW ;
LIPMAN, DJ .
JOURNAL OF MOLECULAR BIOLOGY, 1990, 215 (03) :403-410
[2]  
[Anonymous], 1998, Technical report, DOI DOI 10.1007/978-3-319-08789-4_10
[3]   An automated method for finding molecular complexes in large protein interaction networks [J].
Bader, GD ;
Hogue, CW .
BMC BIOINFORMATICS, 2003, 4 (1)
[4]  
Bader GD, 2003, THESIS U TORONTO
[5]  
Borgwardt KM, 2007, PACIFIC SYMPOSIUM ON BIOCOMPUTING 2007, P4
[6]   Online predicted human interaction database [J].
Brown, KR ;
Jurisica, I .
BIOINFORMATICS, 2005, 21 (09) :2076-2082
[7]   A graph distance metric based on the maximal common subgraph [J].
Bunke, H ;
Shearer, K .
PATTERN RECOGNITION LETTERS, 1998, 19 (3-4) :255-259
[8]   MINT: the molecular INTeraction database [J].
Chatr-aryamontri, Andrew ;
Ceol, Arnaud ;
Palazzi, Luisa Montecchi ;
Nardelli, Giuliano ;
Schneider, Maria Victoria ;
Castagnoli, Luisa ;
Cesareni, Gianni .
NUCLEIC ACIDS RESEARCH, 2007, 35 :D572-D574
[9]  
Cook D.J., 2007, Mining graph data
[10]   Myc's broad reach [J].
Eilers, Martin ;
Eisenman, Robert N. .
GENES & DEVELOPMENT, 2008, 22 (20) :2755-2766