University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Parameter Search and Robustness Analysis from Temporal Logic Specifications in Biochemical Reaction Networks

Parameter Search and Robustness Analysis from Temporal Logic Specifications in Biochemical Reaction Networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

Finding mathematical models satisfying a specification built from the formalization of biological experiments is a common task of the modeler. We show that the formalization of biological temporal properties of systems, as observed in experiments, in temporal logics specifications enable the transposition of programming concepts and tools, like model-checking, to the analysis of living processes at the cellular level. Also as temporal logics allow one to express both qualitative (e.g. some protein is eventually produced) and quantitative (e.g. a concentration exceeds 10) information they are well suited to the increasingly quantitative, yet incomplete, uncertain and imprecise information now accumulated in the field of quantitative systems biology. We define a continuous degree of satisfaction of temporal logic formula and show how it can be used as a fitness function for continuous optimization methods to provide a parameter search procedure for biochemical reaction networks with respect to temporal specifications. Then we describe how we can use such a satisfaction measure for the robustness analysis of biological models. Finally we apply these methods for the analysis of a cell cycle model, on a coupled model of the cell cycle and the circadian clock to search for optimal injections schedule of anticancer drugs, and on a synthetic biology system to find kinetic parameter values that make a given temporal specification robust in a population of cells despite variability.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity