Abstract
Computer simulations of large genetic networks are often extremely time consuming because, in addition to the biologically interesting translation and transcription reactions, many less interesting reactions like DNA binding and dimerizations have to be simulated. It is desirable to use the fact that the latter occur on much faster timescales than the former to eliminate the fast and uninteresting reactions and to obtain effective models of the slow reactions only. We use three examples of self-regulatory networks to show that the usual reduction methods where one obtains a system of equations of the Hill type fail to capture the fluctuations that these networks exhibit due to the small number of molecules; moreover, they may even miss describing the behavior of the average number of proteins. We identify the inclusion of fast-varying variables in the effective description as the cause for the failure of the traditional schemes. We suggest a different effective description, which entails the introduction of an additional species, not present in the original networks, that is slowly varying. We show that this description allows for a very efficient simulation of the reduced system while retaining the correct fluctuations and behavior of the full system. This approach ought to be applicable to a wide range of genetic networks.
Original language | English |
---|---|
Pages (from-to) | 1606-1615 |
Number of pages | 10 |
Journal | Biophysical Journal |
Volume | 84 |
Issue number | 3 |
DOIs | |
State | Published - 1 Mar 2003 |
Externally published | Yes |