Defining Network Topologies that Can Achieve Biochemical Adaptation

Slides:



Advertisements
Similar presentations
High-Resolution Laser Scanning Reveals Plant Architectures that Reflect Universal Network Design Principles  Adam Conn, Ullas V. Pedmale, Joanne Chory,
Advertisements

Volume 77, Issue 5, Pages (March 2013)
Signal, Noise, and Variation in Neural and Sensory-Motor Latency
Computational Re-design of Synthetic Genetic Oscillators for Independent Amplitude and Frequency Modulation  Marios Tomazou, Mauricio Barahona, Karen.
Zhanghan Wu, Jianhua Xing  Biophysical Journal 
Linking Electrical Stimulation of Human Primary Visual Cortex, Size of Affected Cortical Area, Neuronal Responses, and Subjective Experience  Jonathan.
Learning Precisely Timed Spikes
Generating Coherent Patterns of Activity from Chaotic Neural Networks
Defining Network Topologies that Can Achieve Biochemical Adaptation
Volume 66, Issue 6, Pages (June 2010)
Volume 1, Issue 4, Pages (October 2015)
Dynamical Scenarios for Chromosome Bi-orientation
Pejman Mohammadi, Niko Beerenwinkel, Yaakov Benenson  Cell Systems 
Impulse Control: Temporal Dynamics in Gene Transcription
Brendan K. Murphy, Kenneth D. Miller  Neuron 
Shuhei S. Sugai, Koji L. Ode, Hiroki R. Ueda  Cell Reports 
Only Two Ways to Achieve Perfection
Wendell A. Lim, Connie M. Lee, Chao Tang  Molecular Cell 
A Role for the Superior Colliculus in Decision Criteria
Responses of Collicular Fixation Neurons to Gaze Shift Perturbations in Head- Unrestrained Monkey Reveal Gaze Feedback Control  Woo Young Choi, Daniel.
Volume 71, Issue 4, Pages (August 2011)
Volume 85, Issue 4, Pages (February 2015)
Adaptation Disrupts Motion Integration in the Primate Dorsal Stream
Memory without Feedback in a Neural Network
Hippocampal “Time Cells”: Time versus Path Integration
Volume 54, Issue 6, Pages (June 2007)
Reciprocal Inhibition of Inhibition: A Circuit Motif for Flexible Categorization in Stimulus Selection  Shreesh P. Mysore, Eric I. Knudsen  Neuron  Volume.
Attention Governs Action in the Primate Frontal Eye Field
Volume 5, Issue 4, Pages e4 (October 2017)
Volume 27, Issue 23, Pages e3 (December 2017)
Rethinking Motor Learning and Savings in Adaptation Paradigms: Model-Free Memory for Successful Actions Combines with Internal Models  Vincent S. Huang,
Action Selection and Action Value in Frontal-Striatal Circuits
Incoherent Inputs Enhance the Robustness of Biological Oscillators
Ajay S. Pillai, Viktor K. Jirsa  Neuron 
Slow Chromatin Dynamics Allow Polycomb Target Genes to Filter Fluctuations in Transcription Factor Activity  Scott Berry, Caroline Dean, Martin Howard 
Volume 91, Issue 5, Pages (September 2016)
Ajay S. Pillai, Viktor K. Jirsa  Neuron 
Domitilla Del Vecchio, Hussein Abdallah, Yili Qian, James J. Collins 
Pattern Selection by Dynamical Biochemical Signals
Hao Yuan Kueh, Philipp Niethammer, Timothy J. Mitchison 
Cian O’Donnell, Terrence J. Sejnowski  Neuron 
Critical Timing without a Timer for Embryonic Development
Guilhem Ibos, David J. Freedman  Neuron 
Volume 77, Issue 6, Pages (March 2013)
Søren Vedel, Harry Nunns, Andrej Košmrlj, Szabolcs Semsey, Ala Trusina 
Margaret J. Tse, Brian K. Chu, Mahua Roy, Elizabeth L. Read 
Volume 105, Issue 1, Pages (July 2013)
Metabolic Control of Persister Formation in Escherichia coli
Perfect and Near-Perfect Adaptation in Cell Signaling
Volume 82, Issue 3, Pages (May 2014)
Volume 122, Issue 6, Pages (September 2005)
Volume 97, Issue 9, Pages (November 2009)
Ankit Gupta, Benjamin Hepp, Mustafa Khammash  Cell Systems 
Optimal Regulatory Circuit Topologies for Fold-Change Detection
The Ribosome as an Optimal Decoder: A Lesson in Molecular Recognition
Supervised Calibration Relies on the Multisensory Percept
Dale Muzzey, Alexander van Oudenaarden  Cell 
Phosphatase Specificity and Pathway Insulation in Signaling Networks
Hao Yuan Kueh, Philipp Niethammer, Timothy J. Mitchison 
Perceptual Classification in a Rapidly Changing Environment
Finding the Optimal Tradeoffs
Félix Proulx-Giraldeau, Thomas J. Rademaker, Paul François 
Modeling the Cell Cycle: Why Do Certain Circuits Oscillate?
Supratim Ray, John H.R. Maunsell  Neuron 
Morpheus Unbound: Reimagining the Morphogen Gradient
Volume 8, Issue 2, Pages (July 2014)
Steven C. Leiser, Karen A. Moxon  Neuron 
Wenzhe Ma, Chao Tang, Luhua Lai  Biophysical Journal 
Maxwell H. Turner, Fred Rieke  Neuron 
Ping Liu, Ioannis G. Kevrekidis, Stanislav Y. Shvartsman 
Presentation transcript:

Defining Network Topologies that Can Achieve Biochemical Adaptation Wenzhe Ma, Ala Trusina, Hana El-Samad, Wendell A. Lim, Chao Tang  Cell  Volume 138, Issue 4, Pages 760-773 (August 2009) DOI: 10.1016/j.cell.2009.06.013 Copyright © 2009 Elsevier Inc. Terms and Conditions

Figure 1 Searching Topology Space for Adaptation Circuits (A) Input-output curve defining adaptation. (B) Possible directed links among three nodes. (C) Illustrative examples of three-node circuit topologies. (D) Illustration of the analysis procedure for a given topology. Cell 2009 138, 760-773DOI: (10.1016/j.cell.2009.06.013) Copyright © 2009 Elsevier Inc. Terms and Conditions

Figure 2 Minimal Networks (≤3 Links) Capable of Adaptation (A) Adaptive networks composed of negative feedback loops. Three examples of adaptation networks are shown in the upper panel. Each is one member (shaded) of a group of similar adaptation networks, whose signs of regulations are listed underneath. For comparison, three examples of nonadaptive networks are shown in the low panel, with their “defects” for adaptation function listed underneath. (B) Adaptive networks composed of incoherent feedforward loops. The only two minimal adaptation networks in this case are shown in the upper panel. Examples of nonadaptive networks are shown in the lower panel. Cell 2009 138, 760-773DOI: (10.1016/j.cell.2009.06.013) Copyright © 2009 Elsevier Inc. Terms and Conditions

Figure 3 Phase Diagram and Nullcline Analysis of Representative Networks from the Two Classes of Minimal Adaptive Topologies The two networks are shown on the top with the key regulations colored to indicate the parameter constraints for achieving perfect adaptation. (A) Phase planes of the variables B and C for a NFBLB topology. The B nullclines are drawn in black lines and C nullclines in red (solid red for the initial input I1 and dashed red for the changed input I2). The steady states with input I1 and I2 are the intersections of the nullclines and are highlighted by black and gray dots, respectively. When the input is changed from I1 to I2, the trajectory (blue lines) of the system variables follows the vector field (dB/dt, dC/dt) (with input I2), which is denoted by the green arrows. The trajectory's projection on the C axis is the system's output and is shown separately right next to the phase plane. (Refer to Figure 1A for the functional meaning of O1, O2, and Opeak.) Two sets of key parameters (KM's on B) are used to illustrate their effect on adaptation precision: KF0B′ = 0.1 and KCB = 0.1 for the top panel and KF0B′ = 0.01 and KCB = 0.01 for the middle and lower panels. Two sets of rate constants are used to illustrate their effect on sensitivity: kAC = 10 and k′BC = 10 for the top and the middle panels and kAC = 0.1 and k′BC = 0.1 for the lower panel. (B) Phase planes for an IFFLP topology. KF0B′ = 1 and KAB = 0.1 for the top panel. KF0B′ = 100 and KAB = 0.001 for the middle and the lower panels. kAB = 0.5 and kF0B′=10 for the top and the middle panels. kAB = 100 and kF0B′ = 2000 for the lower panel. Cell 2009 138, 760-773DOI: (10.1016/j.cell.2009.06.013) Copyright © 2009 Elsevier Inc. Terms and Conditions

Figure 4 Searching the Full Circuit-Space for All Robust Adaptation Networks (A) The probability plot for all 16,038 networks with all the parameters sampled. Three hundred and ninety-five networks are overrepresented in the functional region shown by the orange rectangle. (B) Venn diagram of networks with three characters: adaptive, containing negative FBL, and containing incoherent FFL. (C) Clustering of the adaptation networks that belong to the NFBLB class. The network motifs associated with each of the subclusters are shown on the right. (D) Clustering of adaptation networks that belong to the IFFLP class. Cell 2009 138, 760-773DOI: (10.1016/j.cell.2009.06.013) Copyright © 2009 Elsevier Inc. Terms and Conditions

Figure 5 General Analysis for Adaptive Circuits (A) Relevant equations. The steady-state output change ΔC∗ with respect to the input change ΔI can be derived from the linearized steady-state equations. A zero adaptation error around a stable steady state requires a zero minor |N| and a nonzero determinant |J| < 0. There are two terms I and II in |N|, and |N| = 0 implies either both terms are zero or they are equal but nonzero. We are only interested in robust adaptation, i.e., the cases where the condition leading to |N| = 0 holds within a range of parameters and input values. (B) NFBLB class of adaptive circuits (I = II = 0). In this category ∂fC/∂A ≠ 0, which means that there is always a link from node A to node C. (Otherwise, there would be no direct or indirect path from A to C.) Then II = 0 implies that ∂fB/B is always zero. I = 0 implies that at least one of ∂fB/∂A and ∂ fC/∂B is zero. This condition implies that there is no feedforward loop in this category. In our enzymatic model ∂fB/∂B = 0 can be robustly achieved either by saturating the enzymes on the node B so that fB does not depend on B explicitly or by adding a positive self-loop on node B so that the dependence of fB on B can be factored out. An example of the latter is when node B is regulated by itself positively and by C negatively, so that fB=kBBB(1−B)/(1−B+KBB)−kCB′CB/(B+kCB′)≈kBBB−kCB′CB/kCB′=B(kBB−kCB′/kCB′C), in the limits (1-B) ≫ KBB and B ≪ K′CB. The terms in the determinant |J| correspond to different feedback loops as colored in the figure. Thus, there should be at least one, but can be two, negative feedback loops in this category. (C) IFFLP class (I = II ≠ 0). In this category, none of the factors in |N| are zero. This implies the presence of the links colored in the figure and hence a FFL. The condition for |N| = 0 can be robustly satisfied if the FFL exerts two opposing but proportional regulations on C. The proportionality relationship can be established by fB taking the form shown in the figure. Cell 2009 138, 760-773DOI: (10.1016/j.cell.2009.06.013) Copyright © 2009 Elsevier Inc. Terms and Conditions

Figure 6 Design Table of Adaptation Networks Two examples are shown on the left for the NFBLB class of adaptation networks, which require a core NFBLB motif with the node B functioning as a buffer. One example is shown on the right for the IFFLP class, which require a core IFFLP motif with the node B functioning as a proportioner. The table is constructed by adding more and more beneficial motifs to the minimal adaptation networks. The Q value (Robustness) of each network is shown underneath, along with the mathematical relation the node B establishes. Cell 2009 138, 760-773DOI: (10.1016/j.cell.2009.06.013) Copyright © 2009 Elsevier Inc. Terms and Conditions

Figure 7 The Network of Perfect Adaptation in E. coli Chemotaxis Belongs to the NFBLB Class of Adaptive Circuits Left: the original network in E. coli. Middle: the redrawn network to highlight the role and the control of the key node “Methylation Level.” Right: one of the minimal adaptation networks in our study. Cell 2009 138, 760-773DOI: (10.1016/j.cell.2009.06.013) Copyright © 2009 Elsevier Inc. Terms and Conditions