Modular Composition of Gene Transcription Networks

Predicting the dynamic behavior of a large network from that of the composing modules is a central problem in systems and synthetic biology. Yet, this predictive ability is still largely missing because modules display context-dependent behavior. One cause of context-dependence is retroactivity, a p...

Full description

Bibliographic Details
Main Authors: Gyorgy, Andras (Contributor), Del Vecchio, Domitilla (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mechanical Engineering (Contributor)
Format: Article
Language:English
Published: Public Library of Science, 2014-04-23T19:34:29Z.
Subjects:
Online Access:Get fulltext
LEADER 02721 am a22002173u 4500
001 86222
042 |a dc 
100 1 0 |a Gyorgy, Andras  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science  |e contributor 
100 1 0 |a Massachusetts Institute of Technology. Department of Mechanical Engineering  |e contributor 
100 1 0 |a Gyorgy, Andras  |e contributor 
100 1 0 |a Del Vecchio, Domitilla  |e contributor 
700 1 0 |a Del Vecchio, Domitilla  |e author 
245 0 0 |a Modular Composition of Gene Transcription Networks 
260 |b Public Library of Science,   |c 2014-04-23T19:34:29Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/86222 
520 |a Predicting the dynamic behavior of a large network from that of the composing modules is a central problem in systems and synthetic biology. Yet, this predictive ability is still largely missing because modules display context-dependent behavior. One cause of context-dependence is retroactivity, a phenomenon similar to loading that influences in non-trivial ways the dynamic performance of a module upon connection to other modules. Here, we establish an analysis framework for gene transcription networks that explicitly accounts for retroactivity. Specifically, a module's key properties are encoded by three retroactivity matrices: internal, scaling, and mixing retroactivity. All of them have a physical interpretation and can be computed from macroscopic parameters (dissociation constants and promoter concentrations) and from the modules' topology. The internal retroactivity quantifies the effect of intramodular connections on an isolated module's dynamics. The scaling and mixing retroactivity establish how intermodular connections change the dynamics of connected modules. Based on these matrices and on the dynamics of modules in isolation, we can accurately predict how loading will affect the behavior of an arbitrary interconnection of modules. We illustrate implications of internal, scaling, and mixing retroactivity on the performance of recurrent network motifs, including negative autoregulation, combinatorial regulation, two-gene clocks, the toggle switch, and the single-input motif. We further provide a quantitative metric that determines how robust the dynamic behavior of a module is to interconnection with other modules. This metric can be employed both to evaluate the extent of modularity of natural networks and to establish concrete design guidelines to minimize retroactivity between modules in synthetic systems. 
520 |a United States. Air Force Office of Scientific Research (FA9550-12-1-0129) 
546 |a en_US 
655 7 |a Article 
773 |t PLoS Computational Biology