Chemical organisation theory

被引:120
作者
Dittrich, Peter [1 ]
di Fenizio, Pietro Speroni
机构
[1] Univ Jena, Bio Syst Anal Grp, Jena Ctr Bioinformat, D-07743 Jena, Germany
[2] Univ Jena, Dept Math & Comp Sci, D-07743 Jena, Germany
关键词
reaction networks; constraint based network analysis; hierarchical decomposition; constructive dynamical systems;
D O I
10.1007/s11538-006-9130-8
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Complex dynamical reaction networks consisting of many components that interact and produce each other are difficult to understand, especially, when new component types may appear and present component types may vanish completely. Inspired by Fontana and Buss (Bull. Math. Biol., 56, 1-64) we outline a theory to deal with such systems. The theory consists of two parts. The first part introduces the concept of a chemical organisation as a closed and self-maintaining set of components. This concept allows to map a complex (reaction) network to the set of organisations, providing a new view on the system's structure. The second part connects dynamics with the set of organisations, which allows to map a movement of the system in state space to a movement in the set of organisations. The relevancy of our theory is underlined by a theorem that says that given a differential equation describing the chemical dynamics of the network, then every stationary state is an instance of an organisation. For demonstration, the theory is applied to a small model of HIV-immune system interaction by Wodarz and Nowak (Proc. Natl. Acad. USA, 96, 14464-14469) and to a large model of the sugar metabolism of E. Coli by Puchalka and Kierzek (Biophys. J., 86, 1357-1372). In both cases organisations where uncovered, which could be related to functions.
引用
收藏
页码:1199 / 1231
页数:33
相关论文
共 35 条
[1]   MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS [J].
ADLEMAN, LM .
SCIENCE, 1994, 266 (5187) :1021-1024
[2]  
[Anonymous], 1984, SOZIALE SYSTEME
[3]   THE GAMMA MODEL AND ITS DISCIPLINE OF PROGRAMMING [J].
BANATRE, JP ;
LEMETAYER, D .
SCIENCE OF COMPUTER PROGRAMMING, 1990, 15 (01) :55-77
[4]   SELF-REPLICATING SEQUENCES OF BINARY-NUMBERS - FOUNDATIONS .1. GENERAL [J].
BANZHAF, W .
BIOLOGICAL CYBERNETICS, 1993, 69 (04) :269-274
[5]   Emergent computation by catalytic reactions [J].
Banzhaf, W ;
Dittrich, P ;
Rauhe, H .
NANOTECHNOLOGY, 1996, 7 (04) :307-314
[6]   A graph-based toy model of chemistry [J].
Benkö, G ;
Flamm, C ;
Stadler, PF .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2003, 43 (04) :1085-1093
[7]   Signaling through receptors and scaffolds: Independent interactions reduce combinatorial complexity [J].
Borisov, NM ;
Markevich, NI ;
Hoek, JB ;
Kholodenko, BN .
BIOPHYSICAL JOURNAL, 2005, 89 (02) :951-966
[8]  
di Fenizio P. S., 2000, GERM WORKSH ART LIF, P1
[9]  
di Fenizio PS, 2000, FROM ANIM ANIMAT, P49
[10]  
Dittrich P, 2003, JASSS, V6