1 The Ribosome Flow Model Michael Margaliot School of Elec. Eng. Tel Aviv University, Israel Tamir Tuller (Tel Aviv University) Eduardo D. Sontag (Rutgers.

Slides:



Advertisements
Similar presentations
Price Of Anarchy: Routing
Advertisements

Modelling Cell Signalling Pathways in PEPA
INTRODUCTION to SWITCHED SYSTEMS ; STABILITY under ARBITRARY SWITCHING
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
Åbo Akademi University & TUCS, Turku, Finland Ion PETRE Andrzej MIZERA COPASI Complex Pathway Simulator.
Stochastic Analysis of Bi-stability in Mixed Feedback Loops Yishai Shimoni, Hebrew University CCS Open Day Sep 18 th 2008.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
CWIT Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems Charalambos D. Charalambous Dept. of Electrical.
PEDESTRAIN CELLULAR AUTOMATA AND INDUSTRIAL PROCESS SIMULATION Alan Jolly (a), Rex Oleson II (b), Dr. D. J. Kaup (c) (a,b,c) Institute for Simulation and.
Infinite Horizon Problems
1 Stability Analysis of Switched Systems: A Variational Approach Michael Margaliot School of EE-Systems Tel Aviv University Joint work with Daniel Liberzon.
Petri net modeling of biological networks Claudine Chaouiya.
Strategies to synchronize biological synthetic networks Giovanni Russo Ph.D. Student University of Naples FEDERICO II Department of Systems and Computer.
TCOM 501: Networking Theory & Fundamentals
Gene Regulatory Networks - the Boolean Approach Andrey Zhdanov Based on the papers by Tatsuya Akutsu et al and others.
Data Flow Analysis Compiler Design Nov. 8, 2005.
1 The Ribosome Flow Model Michael Margaliot School of Electrical Engineering Tel Aviv University, Israel Tamir Tuller (Tel Aviv University) Eduardo D.
1 Stability Analysis of Continuous- Time Switched Systems: A Variational Approach Michael Margaliot School of EE-Systems Tel Aviv University, Israel Joint.
Maximum likelihood (ML)
Antoine Girard VAL-AMS Project Meeting April 2007 Behavioral Metrics for Simulation-based Circuit Validation.
CS6800 Advanced Theory of Computation Fall 2012 Vinay B Gavirangaswamy
Chapter 8 Applications In physics In biology In chemistry In engineering In political sciences In social sciences In business.
1 © Alexis Kwasinski, 2011 DC micro-grids comprise cascade distributed power architectures – converters act as interfaces Point-of-load converters present.
Stability Analysis of Linear Switched Systems: An Optimal Control Approach 1 Michael Margaliot School of Elec. Eng. Tel Aviv University, Israel Joint work.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Waiting time simple queue Little Sojourn time tandem network Jackson network: mean.
Simulation Output Analysis
Asymptotic Techniques
Analyzing the systemic function of genes and proteins Rui Alves.
1 Stability Analysis of Linear Switched Systems: An Optimal Control Approach Michael Margaliot School of Elec. Eng. Tel Aviv University, Israel Joint work.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Dynamics of Traffic Flows in Combined Day-to-day and With- in Day Context Chandra Balijepalli ITS, Leeds September 2004.
Two Temperature Non-equilibrium Ising Model in 1D Nick Borchers.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
A Maximum Principle for Single-Input Boolean Control Networks Michael Margaliot School of Electrical Engineering Tel Aviv University, Israel Joint work.
Mathematical Modeling of Signal Transduction Pathways Biplab Bose IIT Guwahati.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
I/O monotone dynamical systems Germán A. Enciso University of California, Irvine Eduardo Sontag, Rutgers University May 25 rd, 2011.
CS433 Modeling and Simulation Lecture 07 – Part 01 Continuous Markov Chains Dr. Anis Koubâa 14 Dec 2008 Al-Imam.
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
COMMUTATION RELATIONS and STABILITY of SWITCHED SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
Feedback Stabilization of Nonlinear Singularly Perturbed Systems MENG Bo JING Yuanwei SHEN Chao College of Information Science and Engineering, Northeastern.
Minimizing Delay in Shared Pipelines Ori Rottenstreich (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) Yoram Revah, Aviran Kadosh.
A Brief Maximum Entropy Tutorial Presenter: Davidson Date: 2009/02/04 Original Author: Adam Berger, 1996/07/05
CS433 Modeling and Simulation Lecture 11 Continuous Markov Chains Dr. Anis Koubâa 01 May 2009 Al-Imam Mohammad Ibn Saud University.
Stability Analysis of Positive Linear Switched Systems: A Variational Approach 1 Michael Margaliot School of Elec. Eng. -Systems Tel Aviv University, Israel.
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
DYNAMIC BEHAVIOR OF PROCESSES :
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Networks (3TU) Plan for today (lecture 5): Last time / Questions? Tandem network Jackson network: definition Jackson network: equilibrium distribution.
CS 9633 Machine Learning Support Vector Machines
Flows and Networks Plan for today (lecture 4):
Input-to-State Stability for Switched Systems
Islamic University of Gaza Faculty of Engineering
Autonomous Cyber-Physical Systems: Dynamical Systems
Effective Social Network Quarantine with Minimal Isolation Costs
Digital Control Systems (DCS)
Tim Holliday Peter Glynn Andrea Goldsmith Stanford University
Michael Margaliot School of Elec. Eng. -Systems
Totally Positive Differential Systems: A Tutorial and New Results
Stability Analysis of Linear Systems
Rank-Sparsity Incoherence for Matrix Decomposition
Boltzmann Machine (BM) (§6.4)
Chapter 7 Inverse Dynamics Control
Presentation transcript:

1 The Ribosome Flow Model Michael Margaliot School of Elec. Eng. Tel Aviv University, Israel Tamir Tuller (Tel Aviv University) Eduardo D. Sontag (Rutgers University) Joint work with:

2 Overview Ribosome flow Mathematical models: from TASEP to the Ribosome Flow Model (RFM) Analysis of the RFM+biological implications:  Contraction (after a short time)  Monotone systems  Continued fractions

3 From DNA to Proteins Transcription: the cell’s machinery copies the DNA into mRNA The mRNA travels from the nucleus to the cytoplasm Translation: ribosomes “read” the mRNA and produce a corresponding chain of amino-acids

4 Translation v=TfYf_rPWUdY

5 Ribosome Flow During translation several ribosomes read the same mRNA. Ribosomes follow each other like cars traveling along a road. Mathematical models for ribosome flow: TASEP* and the RFM. *Zia, Dong, Schmittmann, “Modeling Translation in Protein Synthesis with TASEP: A Tutorial and Recent Developments”, J. Statistical Physics, 2011

6 Totally Asymmetric Simple Exclusion Process (TASEP) Particles can only hop to empty sites (SE) Movement is unidirectional (TA) A stochastic model: particles hop along a lattice of consecutive sites

Simulating TASEP 7 At each time step, all the particles are scanned and hop with probability, if the consecutive site is empty. This is continued until steady state.

8 Analysis of TASEP* 8 *Schadschneider, Chowdhury & Nishinari, Stochastic Transport in Complex Systems: From Molecules to Vehicles, Mean field approximations 2.Bethe ansatz

Ribosome Flow Model* *Reuveni, Meilijson, Kupiec, Ruppin & Tuller, “Genome-scale analysis of translation elongation with a ribosome flow model”, PLoS Comput. Biol., A deterministic model for ribosome flow. mRNA is coarse-grained into consecutive sites. Ribosomes reach site 1 with rate, but can only bind if the site is empty.

Ribosome Flow Model 10 (normalized) number of ribosomes at site i State-variables : Parameters: >0 initiation rate >0 transition rates between consecutive sites

11 Ribosome Flow Model

12 Ribosome Flow Model Just like TASEP, this encapsulates both unidirectional movement and simple exclusion.

Simulation Results All trajectories emanating from remain in, and converge to a unique equilibrium point e. 13 e

Analysis of the RFM Uses tools from: 14 Contraction theory Monotone systems theory Analytic theory of continued fractions

Contraction Theory* The system: 15 is contracting on a convex set K, with contraction rate c>0, if for all * Lohmiller & Slotine, “On Contraction Analysis for Nonlinear Systems”, Automatica, 1988.

Contraction Theory Trajectories contract to each other at an exponential rate. 16 a b x(t,0,a) x(t,0,b)

Implications of Contraction 1. Trajectories converge to a unique equilibrium point; The system entrains to periodic excitations.

Contraction and Entrainment* Definition is T-periodic if 18 *Russo, di Bernardo, Sontag, “Global Entrainment of Transcriptional Systems to Periodic Inputs”, PLoS Comput. Biol., Theorem The contracting and T-periodic system admits a unique periodic solution of period T, and

How to Prove Contraction? The Jacobian of is the nxn matrix 19

How to Prove Contraction? The infinitesimal distance between trajectories evolves according to 20 This suggests that in order to prove contraction we need to (uniformly) bound J(x).

How to Prove Contraction? Let be a vector norm. 21 The induced matrix norm is: The induced matrix measure is:

How to Prove Contraction? Intuition on the matrix measure: 22 Consider Then to 1 st order in so

Proving Contraction Theorem Consider the system 23 If for all then the Comment 1: all this works for system is contracting on K with contraction rate c. Comment 2: is Hurwitz.

Application to the RFM For n=3, 24 and for the matrix measure induced by the L 1 vector norm: for all The RFM is on the “verge of contraction.”

RFM is not Contracting on C For n=3: 25 so for is singular and thus not Hurwitz.

Contraction After a Short Transient (CAST)* Definition is a CAST if 26 *M., Sontag & Tuller, “Entrainment to Periodic Initiation and Transition Rates in the Ribosome Flow Model”, submitted, there exists such that -> Contraction after an arbitrarily small transient in time and amplitude.

Motivation for Contraction after a Short Transient (CAST) Contraction is used to prove asymptotic properties (convergence to equilibrium point; entrainment to a periodic excitation). 27

Application to the RFM Theorem The RFM is CAST on. 28 Corollary 1 All trajectories converge to a unique equilibrium point e.* *M.& Tuller, “Stability Analysis of the Ribosome Flow Model”, IEEE TCBB, Biological interpretation: the parameters determine a unique steady-state of ribosome distributions and synthesis rate; not affected by perturbations.

Entrainment in the RFM 29

Application to the RFM Theorem The RFM is CAST on C. 30 Corollary 2 Trajectories entrain to periodic initiation and/or transition rates (with a common period T).* Biological interpretation: ribosome distributions and synthesis rate converge to a periodic pattern, with period T. *M., Sontag & Tuller, “Entrainment to Periodic Initiation and Transition Rates in the Ribosome Flow Model”, submitted, 2013.

Entrainment in the RFM 31 Here n=3,

Analysis of the RFM Uses tools from: 32 Contraction theory Monotone systems theory Analytic theory of continued fractions

Monotone Dynamical Systems* Define a (partial) ordering between vectors in R n by: 33 *Smith, Monotone Dynamical Systems: An Introduction to the Theory of Competitive and Cooperative Systems, AMS, 1995 Definition is called monotone if i.e., the dynamics preserves the partial ordering.

Monotone Dynamical Systems in the Life Sciences Used for modeling a variety of biochemical networks:* -behavior is ordered and robust with respect to parameter values -large systems may be modeled as interconnections of monotone subsystems. 34 *Sontag, “Monotone and Near-Monotone Biochemical Networks”, Systems & Synthetic Biology, 2007

When is a System Monotone? Theorem (Kamke Condition.) Suppose that f satisfies: 35 then is monotone. Intuition: assume monotonicity is lost, then

Verifying the Kamke Condition Theorem cooperativity Kamke condition ( system is monotone) 36 This means that increasing increases Definition is called cooperative if

Application to the RFM Every off-diagonal entry is non- negative on C. Thus, the RFM is a cooperative system. 37 Proposition The RFM is monotone on C. Proof :

RFM is Cooperative increase. A “traffic jam” in a site induces “traffic jams” in the neighboring sites. 38 Intuition if x 2 increases then and

RFM is Monotone 39 Biological implication: a larger initial distribution of ribosomes induces a larger distribution of ribosomes for all time.

Analysis of the RFM Uses tools from: 40 Contraction theory Monotone systems theory Analytic theory of continued fractions

41 Continued Fractions Suppose (for simplicity) that n =3. Then Let denote the unique equilibrium point in C. Then

42 Continued Fractions This yields: Every e i can be expressed as a continued fraction of e 3...

43 Continued Fractions Furthermore, e 3 satisfies:.... This is a second-order polynomial equation in e 3. In general, this is a th–order polynomial equation in e n.

44 Homogeneous RFM In certain cases, all the transition rates are approximately equal.* In the RFM this can be modeled by assuming that *Ingolia, Lareau & Weissman, “Ribosome Profiling of Mouse Embryonic Stem Cells Reveals the Complexity and Dynamics of Mammalian Proteomes”, Cell, 2011 This yields the Homogeneous Ribosome Flow Model (HRFM). Analysis is simplified because there are only two parameters.

45 HRFM and Periodic Continued Fractions In the HRFM, This is a periodic continued fraction, and we can say a lot more about e.

46 Equilibrium Point in the HRFM* Theorem In the HRFM, *M. & Tuller, “On the Steady-State Distribution in the Homogeneous Ribosome Flow Model”, IEEE TCBB, 2012 Biological interpretation: This provides an explicit expression for the capacity of a gene.

mRNA Circularization* 47 * Craig, Haghighat, Yu & Sonenberg, ”Interaction of Polyadenylate-Binding Protein with the eIF4G homologue PAIP enhances translation”, Nature, 1998

RFM as a Control System This can be modeled by the RFM with Input and Output (RFMIO): 48 *Angeli & Sontag, “Monotone Control Systems”, IEEE TAC, 2003 and then closing the loop via Remark: The RFMIO is a monotone control system.*

RFM with Feedback* 49 Theorem The closed-loop system admits an equilibrium point e that is globally attracting in C. *M. & Tuller, “Ribosome Flow Model with Feedback”, J. Royal Society -Interface, to appear Biological implication: as before, but this is probably a better model for translation in eukaryotes.

RFM with Feedback* 50 Theorem In the homogeneous case, where Biological implication: may be useful, perhaps, for re-engineering gene translation.

Further Research Analyzing translation: sensitivity analysis; optimizing translation rate; adding features (e.g. drop-off); estimating initiation rate;… 2. TASEP has been used to model: biological motors, surface growth, traffic flow, walking ants, Wi-Fi networks,….

Summary 52 The Ribosome Flow Model is: (1) useful; (2) amenable to analysis. Papers available on-line at: Recently developed techniques provide more and more data on the translation process. Computational models are thus becoming more and more important. THANK YOU!