Internal coarse-graining of molecular systems

被引:137
作者
Feret, Jerome [1 ]
Danos, Vincent [3 ]
Krivine, Jean [1 ]
Harmer, Russ [2 ,4 ]
Fontana, Walter [1 ]
机构
[1] Harvard Univ, Sch Med, Boston, MA 02115 USA
[2] Univ Paris Diderot, F-75006 Paris, France
[3] Univ Edinburgh, Edinburgh EH8 9Y, Midlothian, Scotland
[4] CNRS, F-75006 Paris, France
关键词
protein interaction networks; rule-based models; model reduction; distinguishability; information carriers; CELLULAR SIGNALING NETWORKS; COMBINATORIAL COMPLEXITY; TRANSDUCTION; REDUCTION; DOMAINS; MODEL;
D O I
10.1073/pnas.0809908106
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Modelers of molecular signaling networks must cope with the combinatorial explosion of protein states generated by posttranslational modifications and complex formation. Rule-based models provide a powerful alternative to approaches that require explicit enumeration of all possible molecular species of a system. Such models consist of formal rules stipulating the (partial) contexts wherein specific protein-protein interactions occur. These contexts specify molecular patterns that are usually less detailed than molecular species. Yet, the execution of rule-based dynamics requires stochastic simulation, which can be very costly. It thus appears desirable to convert a rule-based model into a reduced system of differential equations by exploiting the granularity at which rules specify interactions. We present a formal (and automated) method for constructing a coarse-grained and self-consistent dynamical system aimed at molecular patterns that are distinguishable by the dynamics of the original system as posited by the rules. The method is formally sound and never requires the execution of the rule-based model. The coarse-grained variables do not depend on the values of the rate constants appearing in the rules, and typically form a system of greatly reduced dimension that can be amenable to numerical integration and further model reduction techniques.
引用
收藏
页码:6453 / 6458
页数:6
相关论文
共 21 条
[1]   A network model of early events in epidermal growth factor receptor signaling that accounts for combinatorial complexity [J].
Blinov, ML ;
Faeder, JR ;
Goldstein, B ;
Hlavacek, WS .
BIOSYSTEMS, 2006, 83 (2-3) :136-151
[2]   BioNetGen: software for rule-based modeling of signal transduction based on the interactions of molecular domains [J].
Blinov, ML ;
Faeder, JR ;
Goldstein, B ;
Hlavacek, WS .
BIOINFORMATICS, 2004, 20 (17) :3289-3291
[3]   Domain-oriented reduction of rule-based network models [J].
Borisov, N. M. ;
Chistopolsky, A. S. ;
Faeder, J. R. ;
Kholodenko, B. N. .
IET SYSTEMS BIOLOGY, 2008, 2 (05) :342-351
[4]   Trading the micro-world of combinatorial complexity for the macro-world of protein interaction domains [J].
Borisov, NM ;
Markevich, NI ;
Hoek, JB ;
Kholodenko, BN .
BIOSYSTEMS, 2006, 83 (2-3) :152-166
[5]   Modeling networks of coupled enzymatic reactions using the total quasi-steady state approximation [J].
Ciliberto, Andrea ;
Capuani, Fabrizio ;
Tyson, John J. .
PLOS COMPUTATIONAL BIOLOGY, 2007, 3 (03) :463-472
[6]   A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks [J].
Conzelmann, H ;
Saez-Rodriguez, J ;
Sauter, T ;
Kholodenko, BN ;
Gilles, ED .
BMC BIOINFORMATICS, 2006, 7 (1)
[7]  
CONZELMANN H, 2008, THESIS U STUTTGART S
[8]   Exact model reduction of combinatorial reaction networks [J].
Conzelmann, Holger ;
Fey, Dirk ;
Gilles, Ernst D. .
BMC SYSTEMS BIOLOGY, 2008, 2
[9]   Formal molecular biology [J].
Danos, V ;
Laneve, C .
THEORETICAL COMPUTER SCIENCE, 2004, 325 (01) :69-110
[10]  
Danos V, 2008, LECT N BIOINFORMAT, V5054, P103, DOI 10.1007/978-3-540-68413-8_8