Strategies to synchronize biological synthetic networks Giovanni Russo Ph.D. Student University of Naples FEDERICO II Department of Systems and Computer.

Slides:



Advertisements
Similar presentations
Coordination of Multi-Agent Systems Mark W. Spong Donald Biggar Willett Professor Department of Electrical and Computer Engineering and The Coordinated.
Advertisements

Nonlinear Systems: an Introduction to Lyapunov Stability Theory A. Pascoal, Jan
Introduction to Neural Networks Computing
LIAL HORNSBY SCHNEIDER
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
An Intro To Systems Biology: Design Principles of Biological Circuits Uri Alon Presented by: Sharon Harel.
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
Properties of State Variables
Ch 9.1: The Phase Plane: Linear Systems
Some Ideas Behind Finite Element Analysis
Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique.
עקיבה אחר מטרה נעה Stable tracking control method for a mobile robot מנחה : ולדיסלב זסלבסקי מציגים : רונן ניסים מרק גרינברג.
INTEGRALS Areas and Distances INTEGRALS In this section, we will learn that: We get the same special type of limit in trying to find the area under.
Dynamical Systems Analysis II: Evaluating Stability, Eigenvalues By Peter Woolf University of Michigan Michigan Chemical Process Dynamics.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Visual Recognition Tutorial
Optical Flow Estimation using Variational Techniques Darya Frolova.
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
Assigning Numbers to the Arrows Parameterizing a Gene Regulation Network by using Accurate Expression Kinetics.
Maximum likelihood (ML)
1 10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent.
Applications of Differential Equations in Synthetic Biology
Adaptive Signal Processing
Normalised Least Mean-Square Adaptive Filtering
UNIVERSITI MALAYSIA PERLIS
EXAMPLES: Example 1: Consider the system Calculate the equilibrium points for the system. Plot the phase portrait of the system. Solution: The equilibrium.
Section 8.1 Estimating  When  is Known In this section, we develop techniques for estimating the population mean μ using sample data. We assume that.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Stochastic modeling of molecular reaction networks Daniel Forger University of Michigan.
INTEGRALS 5. INTEGRALS In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.
Integrals  In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.  In much the.
Model Reference Adaptive Control (MRAC). MRAS The Model-Reference Adaptive system (MRAS) was originally proposed to solve a problem in which the performance.
Robustness in protein circuits: adaptation in bacterial chemotaxis 1 Information in Biology 2008 Oren Shoval.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Synchronization in complex network topologies
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
1 8. One Function of Two Random Variables Given two random variables X and Y and a function g(x,y), we form a new random variable Z as Given the joint.
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
1 6. Mean, Variance, Moments and Characteristic Functions For a r.v X, its p.d.f represents complete information about it, and for any Borel set B on the.
Applications of Differentiation Section 4.9 Antiderivatives
In Chapters 6 and 8, we will see how to use the integral to solve problems concerning:  Volumes  Lengths of curves  Population predictions  Cardiac.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Solving Scalar Linear Systems A Little Theory For Jacobi Iteration
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
RELIABLE DYNAMIC ANALYSIS OF TRANSPORTATION SYSTEMS Mehdi Modares, Robert L. Mullen and Dario A. Gasparini Department of Civil Engineering Case Western.
Approximation Algorithms based on linear programming.
CORRELATION-REGULATION ANALYSIS Томский политехнический университет.
Ch 9.6: Liapunov’s Second Method In Section 9.3 we showed how the stability of a critical point of an almost linear system can usually be determined from.
Virtual Gravity Control for Swing-Up pendulum K.Furuta *, S.Suzuki ** and K.Azuma * * Department of Computers and Systems Engineering, TDU, Saitama Japan.
Copyright © Cengage Learning. All rights reserved. 4.4 Indefinite Integrals and the Net Change Theorem.
Chapter 5: Integration Section 5.1 An Area Problem; A Speed-Distance Problem An Area Problem An Area Problem (continued) Upper Sums and Lower Sums Overview.
Copyright © Cengage Learning. All rights reserved.
12. Principles of Parameter Estimation
Computing and Compressive Sensing in Wireless Sensor Networks
Ch7: Hopfield Neural Model
Boyce/DiPrima 9th ed, Ch 9.6: Liapunov’s Second Method Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce.
Task: It is necessary to choose the most suitable variant from some set of objects by those or other criteria.
§7-4 Lyapunov Direct Method
Automatic Picking of First Arrivals
Quantum Two.
Autonomous Cyber-Physical Systems: Dynamical Systems
Numerical Analysis Lecture 16.
Stability Analysis of Linear Systems
Corentin Briat, Ankit Gupta, Mustafa Khammash  Cell Systems 
EXAMPLES: Example 1: Consider the system
12. Principles of Parameter Estimation
16. Mean Square Estimation
Chapter 7 Inverse Dynamics Control
Presentation transcript:

Strategies to synchronize biological synthetic networks Giovanni Russo Ph.D. Student University of Naples FEDERICO II Department of Systems and Computer Science LAB Meeting 28/04/2008

Outline In the previous episode… A condition for synchronization and generalizations Future work

In the previous episode…

Giovanni Russo The Repressilator The Repressilator is a network of three genes, the products of which inhibit the transcription of each other in a cyclic way. Here is represented a modular addition with the aim of coupling a population of cells. Ref: J. Garcia-Ojalvo, M. B. Elowitz, S. H. Strogatz (2004)

The mathematical model The mathematical model can also be rewritten in a form that underlines the structure of the biological system.

Studying synchronization… In order to study synchronization Contraction theory is used. Suppose now that all the nodes are identical The following virtual system can be used:

Network of identical nodes (1) Theorem: Differentiation of the virtual system yields the dynamics for the virtual displacements and velocities:

Network of identical nodes (2) Thus, we have to prove that the matrix: Is contracting. Theorem: Let A be a square matrix, and let Then all the eigenvalues of A are located in the union of n discs: Corollary: Let A be a square matrix, and let p1, p2,...pn be positive real numbers. Then all the eigenvalues of A lie in the region

Application of the Gersghorin theorem (1) Using the previous Corollary, the condition warranting the negativity of all the eigenvalues of the Jacobian matrix is:

Application of the Gersghorin theorem (2) Since the derivative of the activation and inhibition functions are bounded, from the previous relations we have: This set of inequalities seems to have no solution for the set of parameters used in the literature!

...and now? If the first three inequalities were The whole system would be consistent On the other hand if we slightly modify our system in the following manner:

A modified mathematical model The set of inequalities becomes: Then, if d>>β, the system can be solved. The network can be better synchronized if max{f(*)} are decreased

A condition for synchronization and generalizations

A condition for synchronization in a network of Repressilators In the above case study we have seen that using contraction theory and the disks theorem it is possible to obtain a condition on the set of parameters that warrants the existence of a stable synchronous state In particular the following procedure was used: 1. Definition of a virtual system and differentiation, 2. Derivation of a set of inequalities from the disks’ theorem, 3. Check if exists a set of parameters for which the inequalities hold!

Generalization of the results Consider a matrix of the form: It’s possible to see that all its eigenvalues are negative if From a biological point of view this means that the maximum production/inhibition rate must be less than the self degradation for at least one specie in the system.

Remarks (1) The procedure is made on the worst-case: indeed, the maxima of the Hill functions are considered. The above matrix does not take into account the case in which the terms on the diagonal elements are not constant: this is the case in which the degradation of a protein (or mRNA) is determined by other proteins (or mRNAs) For example, consider:

Remarks (2) It is easy to check that differentiation yields a Jacobian matrix with diagonal terms depending on the state variables In this case one could give a condition on the minimum of those elements: however, this criterion could be very restrictive in the cases in which the minimum is near zero (as in the considered case, in which the minimum of the periodic trajectory is near to zero). Another way to proceed is to satisfy the inequalities given by the application of the circle criterion for the functions present in the Jacobian matrix. If the object of the study is to design a synthetic circuit, then the set of inequalities could be easily satisfied.

Network of nonidentical nodes The contracting property, warrant (stochastic) synchronization in presence of noise (since the stochastic contracting property is preserved in systems combinations). We can take into account the mismatch of parameters between the cells using white noise: for our purposes it’s possible to modify each protein equation in the following manner: Since a and A are bounded and w β is a white noise with mean equal to zero, we are in the hypotheses in which the stochastic contraction theory holds. What happens if the nodes are not all identical?

Giovanni Russo A control strategy: centralized controller The controller is implemented in a different cell (or cell population) from that of the population. Advantages: the use of an external controller could be easily implemented, the control action will be moderate, we foresee a robust control Drawbacks: the main drawback is the lack of informations for the controller. It can use only informations about the extra-cellular auto-inducer; this will be the control input too. Controllers population

Simulation results If noise is included into the differential equation of the coupling protein….

Simulation results

If, on the other hand, time delay is included into the differential equation of the coupling protein….

Simulation results

Future work

Quorum sensing as a protocol for synchronization Bacteria lives different environments: however, in each of them continually chemical signals run. In other words, small molecule, called autoinducer link the population of bacteria and carry informations. The autoinducer molecules accumulate themselves near the bacteria: when the concentration near a bacterium exceeds a certain threshold (quorum), some intracellular reactions are activated. Thanks to this mechanism, bacteria can coordinate their actions. It’s interesting to note here that the global behavior of the population is driven by the local measurement made by each bacterium.

Modeling quorum sensing How to study this closed loop system (even in the case of linear systems at the nodes)? 1. Lyapunov function: 2. Hyperstability….

A biologically inspired consensus protocol (1) It is proven that bacteria move along gradients of specific chemicals: this process is called bacterial chemotaxis. Bacterial chemotaxis achieves remarkable performance considering the physical limitations faced by bacteria. They can detect concentration gradients as small as a change of one molecule per cell volume per micron and function in background concentrations spanning over five orders of magnitude. All this is done under strong white noise, such that if the cell tries to swim straight for 10 s, its orientation is randomized by 90° on average. How E. coli manage to move up gradients of attractants despite these physical limitations? The key stands in the fact that E. coli uses temporal gradients to drive its motion: in particular a biased-random-walk strategy is used to sample space and convert spatial gradients to temporal ones.

A biologically inspired consensus protocol (2) To sense gradients, E. coli compares the current attractant concentration to the concentration in the past! If a positive net change of attractant concentration is sensed than the movement will be in the corresponding direction. Idea: Is it possible to use this high-performance strategy in other kinds of networks? Applications would be, for example: Sensor networks Mobile agents …

Giovanni Russo Thanks!