From sequence to dynamics: the effects of transcription factor and polymerase concentration changes on activated and repressed promoters

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 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.

Biological modules are inherently context-dependent as the input/output behavior of a module often changes upon connection with other modules. One source of context-dependence is retroactivity, a loading phenomenon by which a downstream system affects the behavior of an upstream system upon interconnection. This fact renders it difficult to predict how modules will behave once connected to each other. In this paper, we propose a general modeling framework for gene transcription networks to accurately predict how retroactivity affects the dynamic behavior of interconnected modules, based on salient physical properties of the same modules in isolation. We illustrate how our framework predicts surprising and counter-intuitive dynamic properties of naturally occurring network structures, which cannot be captured by existing models of the same dimension. We describe implications of our findings on the bottom-up approach to designing synthetic circuits, and on the top-down approach to identifying functional modules in natural networks, revealing trade-offs between robustness to interconnection and dynamic performance. Our framework carries substantial conceptual analogies with electrical network theory based on equivalent representations. We believe that the framework we have proposed, also based on equivalent network representations, can be similarly useful for the analysis and design of biological networks.

A lattice model for transcription factor access to nucleosomal DNA

Nucleosomes, the basic repeating unit of chromatin, consist of 147 basepairs of DNA that are wrapped in almost two turns around a histone protein octamer core. Because ∼3/4 of the human genomic DNA is found within nucleosomes, their position and DNA interaction is an essential determinant for the DNA access of gene-specific transcription factors and other proteins. Here, a DNA lattice model was developed for describing ligand binding in the presence of a nucleosome. The model takes into account intermediate states, in which DNA is partially unwrapped from the histone octamer. This facilitates access of transcription factors to up to 60 DNA basepairs located in the outer turn of nucleosomal DNA, while the inner DNA turn was found to be more resistant to competitive ligand binding. As deduced from quantitative comparisons with recently published experimental data, our model provides a better description than the previously used all-or-none lattice-binding model. Importantly, nucleosome-occupancy maps predicted by the nucleosome-unwrapping model also differed significantly when partial unwrapping of nucleosomal DNA was considered. In addition, large effects on the cooperative binding of transcription factors to multiple binding sites occluded by the nucleosome were apparent. These findings indicate that partial unwrapping of DNA from the histone octamer needs to be taken into account in quantitative models of gene regulation in chromatin.

Predicting gene-regulation functions: lessons from temperate bacteriophages

Gene-regulation functions (GRF) provide a unique characteristic of a cis-regulatory module (CRM), relating the concentrations of transcription factors (input) to the promoter activities (output). The challenge is to predict GRFs from the sequence. Here we systematically consider the lysogeny-lysis CRMs of different temperate bacteriophages such as the Lactobacillus casei phage A2, Escherichia coli phages lambda, and 186 and Lactococcal phage TP901-1. This study allowed explaining a recent experimental puzzle on the role of Cro protein in the lambda switch. Several general conclusions have been drawn: 1), long-range interactions, multilayer assembly and DNA looping may lead to complex GRFs that cannot be described by linear functions of binding site occupancies; 2), in general, GRFs cannot be described by the Boolean logic, whereas a three-state non-Boolean logic suffices for the studied examples; 3), studied CRMs of the intact phages seemed to have a similar GRF topology (the number of plateaus and peaks corresponding to different expression regimes); we hypothesize that functionally equivalent CRMs might have topologically equivalent GRFs for a larger class of genetic systems; and 4) within a given GRF class, a set of mechanistic-to-mathematical transformations has been identified, which allows shaping the GRF before carrying out a system-level analysis.