A unified representation of multiprotein complex data for modeling interaction networks

被引:20
作者
Ding, C [1 ]
He, XF
Meraz, RF
Holbrook, SR
机构
[1] Lawrence Berkeley Natl Lab, Computat Res Div, Berkeley, CA 94720 USA
[2] Lawrence Berkeley Natl Lab, Phys Biosci Div, Berkeley, CA USA
关键词
protein complex; supercomplex; gene ontology; bipartite graphic; cluster analysis; network biology;
D O I
10.1002/prot.20147
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
The protein interaction network presents one perspective for understanding cellular processes. Recent experiments employing high-throughput mass spectrometric characterizations have resulted in large data sets of physiologically relevant multiprotein complexes. We present a unified representation of such data sets based on an underlying bipartite graph model that is an advance over existing models of the network. Our unified representation allows for weighting of connections between proteins shared in more than one complex, as well as addressing the higher level organization that occurs when the network is viewed as consisting of protein complexes that share components. This representation also allows for the application of the rigorous MinMaxCut graph clustering algorithm for the determination of relevant protein modules in the networks. Statistically significant annotations of clusters in the protein-protein and complex-complex networks using terms from the Gene Ontology indicate that this method will be useful for posing hypotheses about uncharacterized components of protein complexes or uncharacterized relationships between protein complexes. (C) 2004 Wiley-Liss, Inc.
引用
收藏
页码:99 / 108
页数:10
相关论文
共 35 条
[1]   Biological networks [J].
Alm, E ;
Arkin, AP .
CURRENT OPINION IN STRUCTURAL BIOLOGY, 2003, 13 (02) :193-202
[2]   Gene Ontology: tool for the unification of biology [J].
Ashburner, M ;
Ball, CA ;
Blake, JA ;
Botstein, D ;
Butler, H ;
Cherry, JM ;
Davis, AP ;
Dolinski, K ;
Dwight, SS ;
Eppig, JT ;
Harris, MA ;
Hill, DP ;
Issel-Tarver, L ;
Kasarskis, A ;
Lewis, S ;
Matese, JC ;
Richardson, JE ;
Ringwald, M ;
Rubin, GM ;
Sherlock, G .
NATURE GENETICS, 2000, 25 (01) :25-29
[3]   An automated method for finding molecular complexes in large protein interaction networks [J].
Bader, GD ;
Hogue, CW .
BMC BIOINFORMATICS, 2003, 4 (1)
[4]   Analyzing yeast protein-protein interaction data obtained from different sources [J].
Bader, GD ;
Hogue, CWV .
NATURE BIOTECHNOLOGY, 2002, 20 (10) :991-997
[5]   Topological structure analysis of the protein-protein interaction network in budding yeast [J].
Bu, DB ;
Zhao, Y ;
Cai, L ;
Xue, H ;
Zhu, XP ;
Lu, HC ;
Zhang, JF ;
Sun, SW ;
Ling, LJ ;
Zhang, N ;
Li, GJ ;
Chen, RS .
NUCLEIC ACIDS RESEARCH, 2003, 31 (09) :2443-2450
[6]  
Deng Minghua, 2003, Pac Symp Biocomput, P140
[7]   Charting the protein complexome in yeast by mass spectrometry [J].
Deshaies, RJ ;
Seol, JH ;
McDonald, WH ;
Cope, G ;
Lyapina, S ;
Shevchenko, A ;
Shevchenko, A ;
Verma, R ;
Yates, JR .
MOLECULAR & CELLULAR PROTEOMICS, 2002, 1 (01) :3-10
[8]  
DING C, 2002, P 6 INT C COMP MOL B, V6, P127
[9]   A min-max cut algorithm for graph partitioning and data clustering [J].
Ding, CHQ ;
He, XF ;
Zha, HY ;
Gu, M ;
Simon, HD .
2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, :107-114
[10]   Saccharomyces Genome Database (SGD) provides secondary gene annotation using the Gene Ontology (GO) [J].
Dwight, SS ;
Harris, MA ;
Dolinski, K ;
Ball, CA ;
Binkley, G ;
Christie, KR ;
Fisk, DG ;
Issel-Tarver, L ;
Schroeder, M ;
Sherlock, G ;
Sethuraman, A ;
Weng, S ;
Botstein, D ;
Cherry, JM .
NUCLEIC ACIDS RESEARCH, 2002, 30 (01) :69-72