R OBUSTNESS ANALYSIS AND TUNING OF SYNTHETIC GENE NETWORKS Grégory Batt, Boyan Yordanov, Ron Weiss, and Calin Belta 1 VC Lab, Dept. of Computer Science,

Slides:



Advertisements
Similar presentations
1 Verification by Model Checking. 2 Part 1 : Motivation.
Advertisements

Chapter 0 Review of Algebra.
Chapter 6 Matrix Algebra.
Solving Systems of Equations using Substitution
RSLAB-NTU Lab for Remote Sensing Hydrology and Spatial Modeling 1 An Introduction to R Pseudo Random Number Generation (PRNG) Prof. Ke-Sheng Cheng Dept.
STATISTICS Random Variables and Distribution Functions
Michael R. Smith, Mark Clement, Tony Martinez, and Quinn Snell
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
1 Reasoning with Promela Safety properties bad things do not happen can check by inspecting finite behaviours Liveness properties good things do eventually.
1 Abstraction (Cont’d) Defining an Abstract Domain variable elimination, data abstraction, predicate abstraction Abstraction for Universal/Existential.
Auto-Generation of Test Cases for Infinite States Reactive Systems Based on Symbolic Execution and Formula Rewriting Donghuo Chen School of Computer Science.
Discrete time Markov Chain
Robustness Analysis and Tuning of Synthetic Gene Networks Grégory Batt Center for Information and Systems Engineering and Center for BioDynamics Boston.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2012 – 70343: A Robust Technique for Lumped Parameter Inverse.
Robustness Analysis and Tuning of Synthetic Gene Networks Grégory Batt 1 Boyan Yordanov 1 Calin Belta 1 Ron Weiss 2 1 Centers for Information and Systems.
Z34Bio: A Framework for Analyzing Biological Computation
Solve by Substitution: Isolate one variable in an equation
Drawing Graphs of Quadratic Functions
Abbas Edalat Imperial College London Contains joint work with Andre Lieutier (AL) and joint work with Marko Krznaric (MK) Data Types.
A Partition Modelling Approach to Tomographic Problems Thomas Bodin & Malcolm Sambridge Research School of Earth Sciences, Australian National University.
UNIT 2: SOLVING EQUATIONS AND INEQUALITIES SOLVE EACH OF THE FOLLOWING EQUATIONS FOR y. # x + 5 y = x 5 y = 2 x y = 2 x y.
Solving Linear Systems by Graphing
10-7 The Quadratic Formula
U1A L1 Examples FACTORING REVIEW EXAMPLES.
Dantzig-Wolfe Decomposition
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
TOWARDS a UNIFIED FRAMEWORK for NONLINEAR CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer.
DETC ASME Computers and Information in Engineering Conference ONE AND TWO DIMENSIONAL DATA ANALYSIS USING BEZIER FUNCTIONS P.Venkataraman Rochester.
1 October 16 th, 2009 Meaning to motion: Transforming specifications to provably-correct control Hadas Kress-Gazit Cornell University George Pappas University.
M ODEL CHECKING -Vasvi Kakkad University of Sydney.
François Fages MPRI Bio-info 2005 Formal Biology of the Cell Modeling, Computing and Reasoning with Constraints François Fages, Constraint Programming.
François Fages MPRI Bio-info 2007 Formal Biology of the Cell Modeling, Computing and Reasoning with Constraints François Fages, Constraint Programming.
François Fages MPRI Bio-info 2007 Formal Biology of the Cell Inferring Reaction Rules from Temporal Properties François Fages, Constraint Programming Group,
Hybrid Systems Presented by: Arnab De Anand S. An Intuitive Introduction to Hybrid Systems Discrete program with an analog environment. What does it mean?
Model Checking Genetic Regulatory Networks with Parameter Uncertainty Grégory Batt, Calin Belta, Ron Weiss HSCC 2007 Presented by Spring Berman ESE :
Robustness analysis and tuning of synthetic gene networks February 15, 2008 Eyad Lababidi Based on the paper “Robustness analysis and tuning of synthetic.
Formal Verification of Hybrid Models of Genetic Regulatory Networks Grégory Batt Center for Information and Systems Engineering and Center for BioDynamics.
Petri net modeling of biological networks Claudine Chaouiya.
D IVERSITY - BASED, MODEL - GUIDED CONSTRUCTION OF SYNTHETIC GENE NETWORKS WITH PREDICTED FUNCTIONS Tom Ellis, Xiao Wang & James J Collins 1 VC Lab, Dept.
T IME WARPING OF EVOLUTIONARY DISTANT TEMPORAL GENE EXPRESSION DATA BASED ON NOISE SUPPRESSION Yury Goltsev and Dmitri Papatsenko *Department of Molecular.
N OISE P ROPAGATION IN G ENE N ETWORKS Juan M. Pedraza and Alexander van Oudenaarden 1 VC Lab, Dept. of Computer Science, NTHU, Taiwan.
Discrete Abstractions of Hybrid Systems Rajeev Alur, Thomas A. Henzinger, Gerardo Lafferriere and George J. Pappas.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
ESE601: Hybrid Systems Introduction to verification Spring 2006.
Rational Root Theorem. Finding Zeros of a Polynomial Function Use the Rational Zero Theorem to find all possible rational zeros. Use Synthetic Division.
CONTROL of NONLINEAR SYSTEMS with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
2.3 Introduction to Functions
A ROBUST B AYESIAN TWO - SAMPLE TEST FOR DETECTING INTERVALS OF DIFFERENTIAL GENE EXPRESSION IN MICROARRAY TIME SERIES Oliver Stegle, Katherine Denby,
2.1 – Linear and Quadratic Equations Linear Equations.
Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.
Differential Equations Linear Equations with Variable Coefficients.
Biomolecular implementation of linear I/O systems Lecture 4/7/2016 Oishi, Kazuaki, and Eric Klavins. "Biomolecular implementation of linear I/O systems."
Safe Execution of Bipedal Walking Tasks from Biomechanical Principles Andreas Hofmann and Brian Williams.
S PIKE LATENCY AND JITTER OF NEURONAL MEMBRANE PATCHES WITH STOCHASTIC H ODGKIN –H UXLEY CHANNELS Mahmut Ozer, MuhammetUzuntarla, Matjaž Perc, Lyle J.Graham.
S5.40. Module Structure 30% practical tests / 70% written exam 3h lectures / week (except reading week) 3 x 2h of computer labs (solving problems practicing.
Noise Propagation in Gene Networks
Optimization Based Design of Robust Synthetic
Introduction to Functions
Machine Learning Today: Reading: Maria Florina Balcan
Piecewise Quiz!.
3.5 Solving Nonlinear Systems
Quadratic Equations.
Objectives Identify solutions of linear equations in two variables.
7.1 solving linear systems by graphing
Solve the differential equation using the method of undetermined coefficients. y " + 4y = e 3x 1. {image}
Solve the differential equation using the method of undetermined coefficients. y " + 9y = e 2x {image}
Introduction to verification
RELATIONS & FUNCTIONS CHAPTER 4.
Experiments, Outcomes, Events and Random Variables: A Revisit
Introduction CSE 541.
Presentation transcript:

R OBUSTNESS ANALYSIS AND TUNING OF SYNTHETIC GENE NETWORKS Grégory Batt, Boyan Yordanov, Ron Weiss, and Calin Belta 1 VC Lab, Dept. of Computer Science, NTHU, Taiwan

O VERVIEW Introduction Problems of biological system design Previous solution Problem Piecewise-Multiaffine Models Linear Temporal Logic(LTL) Two problems Conclusion Reference 2 VC Lab, Dept. of Computer Science, NTHU, Taiwan

I NTRODUCTION Problems of biological system design Lack of precise knowledge Molecular concentrations Parameter values Previous solution Coarse-grained models Nonlinear differential equation models Stochastic models 3 VC Lab, Dept. of Computer Science, NTHU, Taiwan

P IECEWISE -M ULTIAFFINE M ODELS Non-linear model Smooth sigmoidal function 4 VC Lab, Dept. of Computer Science, NTHU, Taiwan

P IECEWISE -M ULTIAFFINE M ODELS Non-linear model Smooth sigmoidal function 5 VC Lab, Dept. of Computer Science, NTHU, Taiwan

LTL 6 VC Lab, Dept. of Computer Science, NTHU, Taiwan Linear Temporal Logic(LTL) logical operators negation (¬) logical and (^), logical or ( ˇ ) implication () temporal operators future ( F ), globally (G), and until (U) EX:

P ROBLEM Let Σ be a PMA system, P an hyperrectangular parameter space, and φ an LTL formula. Robustness: Check whether P is valid for φ. Cant be solve by numerical integration Tuning: Find a set P P such that P is valid for φ. 7 VC Lab, Dept. of Computer Science, NTHU, Taiwan

P ROBLEM 1: R OBUSTNESS Discrete abstractions Partition of state space Discrete transition system Finite Test Σ satisfies φ 8 VC Lab, Dept. of Computer Science, NTHU, Taiwan

P ROBLEM 2: T UNING 9 VC Lab, Dept. of Computer Science, NTHU, Taiwan

P ROBLEM 2: T UNING 15 valid parameters (1.8%) (total 2.27% from 20,000 parameter) No more than ±20% parameter variations 10 VC Lab, Dept. of Computer Science, NTHU, Taiwan

C ONCLUSION RoVerGeNe A PMA model, an LTL specification Generate the temporal space and test the property range Parameter tuning 11 VC Lab, Dept. of Computer Science, NTHU, Taiwan

R EFERENCE Batt,G. et al. (2007a) Model checking genetic regulatory networks with parameter uncertainty. In Bemporad,A. et al. (eds). Hybrid Systems: Computation and Control, HSCC07 Belta,C. and Habets,L.C.G.J.M. (2006) Controlling a class of nonlinear systems on rectangles. Trans. Aut. Control, 51, 1749– VC Lab, Dept. of Computer Science, NTHU, Taiwan