Environmental selection of the feed-forward loop circuit in gene-regulation networks.

Department of Molecular Cell Biology, The Weizmann Institute of Science, Rehovot, 76100, Israel.
Physical Biology (Impact Factor: 3.14). 07/2005; 2(2):81-8. DOI: 10.1088/1478-3975/2/2/001
Source: PubMed

ABSTRACT Gene-regulation networks contain recurring elementary circuits termed network motifs. It is of interest to understand under which environmental conditions each motif might be selected. To address this, we study one of the most significant network motifs, a three-gene circuit called the coherent feed-forward loop (FFL). The FFL has been demonstrated theoretically and experimentally to perform a basic information-processing function: it shows a delay following ON steps of an input inducer, but not after OFF steps. Here, we ask under what environmental conditions might the FFL be selected over simpler gene circuits, based on this function. We employ a theoretical cost-benefit analysis for the selection of gene circuits in a given environment. We find conditions that the environment must satisfy in order for the FFL to be selected over simpler circuits: the FFL is selected in environments where the distribution of the input pulse duration is sufficiently broad and contains both long and short pulses. Optimal values of the biochemical parameters of the FFL circuit are determined as a function of the environment such that the delay in the FFL blocks deleterious short pulses of induction. This approach can be generally used to study the evolutionary selection of other network motifs.

Download full-text


Available from: Uri Alon, Jul 02, 2015
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We study the quadratic control of a class of stochastic hybrid systems with linear continuous dynamics for which the lengths of time that the system stays in each mode are independent random variables with given probability distribution functions. We derive a condition for finding the optimal feedback policy that minimizes a discounted infinite horizon cost. We show that the optimal cost is the solution to a set of differential equations with unknown boundary conditions. Furthermore, we provide a recursive algorithm for computing the optimal cost and the optimal feedback policy. The applicability of our result is illustrated through a numerical example, motivated by stochastic gene regulation in biology.
    Automatica 10/2014; DOI:10.1016/j.automatica.2014.10.012 · 3.13 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Living cells are continuously monitoring their surroundings and making appropriate decisions to enhance chances of survival. Information regarding environmental conditions is processed in biochemical and genetic networks, eventually leading to a cellular phenotype. However, for all transfer of information, a large number of possible network topologies are available to the cell to choose from. In the common bacterium Escherichia coli, frequency of certain topologies far outnumbers others. What decides the choice of a particular network over the others? In this work, we work with the simplest transcriptional network -an interaction between a regulator, R and its target gene, T -and develop a computational and experimental framework to characterize performance of different possible networks in terms of a list of objective functions. Our results suggest and we speculate that a group of proteins evolve into a particular network topology so as to optimize the most crucial objective function for their particular role in cellular physiology.
    12th IFAC Symposium on Computer Applications in Biotechnology, IIT Bombay, Mumbai, India; 12/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input-output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria.
    Physical Biology 08/2012; 9(5):056001. DOI:10.1088/1478-3975/9/5/056001 · 3.14 Impact Factor