Title: Mathematical Models and Experimental Verification of a CellDeath Process
1Mathematical Models and Experimental Verification
of a Cell-Death Process
Nadia Ugel NYU Bioinformatics Group (Joint work
with Shih-Chieh Lin,Yuri Lazebnik Bud Mishra)
July 25, 2004. International Conference for
Mathematics in Biology and Medicine.
2Reasoning and Experimentation
Model Simulation
Model Construction
Comparison
Hypotheses
Revision
Experimental Results
3How much of reasoning about biology can be
automated?
- We claim that, by drawing upon mathematical
approaches developed in the context of dynamical
systems, kinetic analysis, computational theory
and logic, it is possible to create powerful
simulation, analysis and reasoning tools for
working biologists to be used in deciphering
existing data, devising new experiments and
ultimately, understanding functional properties
of genomes, proteomes, cells, organs and
organisms.
4Part I Mathematics
- Automated Translation from Graphical to
Mathematical Model - Automated Verification of Properties
5Different Representations
Lee, Salic, Krüger, Heinrich, Kirschner
6Who are the players?
- For each reaction we can identify one or more
- Reactant
- its concentration affects and is affected (-)
by the reaction rate - Product
- its concentration is affected () by the
reaction rate - Modifier
- its concentration affects the reaction rate
7What are the rules?
- To each reaction we can associate
8Simple Example
Pathway
ODE
9Canonical Form
for n dependent and m independent species
- Characteristics
- Predefined Modular Structure
- Computational Manipulation
- Scalability
10Temporal Logic and Model Checking
- Set of Queries (through Model Checking)
- summarize the numerical traces into an automaton
with distinguishable biological states and a
deterministic set of rules of transition from
state to state - check the automaton model for its ability to
satisfy various temporal logic statements
- Set of Differential Equations
11Temporal Logic
- Next Time X P
- the property P holds in the second state of the
path - Eventually F P
- the property P will hold at some state on the
path (in the future) - Always G P
- the property P holds at every state on the path
(globally) - Until P U Q
- the property Q holds at some state on the path
and property P holds at all preceding states
12Model Checking
- is an automatic technique for verifying
correctness of temporal properties - is efficient (linear on the number of states)
- will terminate with an answer indicating that the
model satisfies the formula or show a
counter-example in case it does not
13Automaton
- Simple Approach
- The values of the variables uniquely characterize
the state of the system. - The succession of the integration steps describes
the possible transitions. - More Sophisticated Approach
- Grouping several time instants according to some
simple rules.
14Bisimulation
- Definition of projection operation
- (restriction to a subset of interesting
variables) - to generate reduced automata satisfying the same
formulae as the initial ones.
15Part II Biology
- Apoptosis is a form of programmed cell death.
- Receptor Mediated (external)
- Receptor Independent (internal)
16Caspases
17Mitochondria
DNA
nucleus
DEVD-Afc
18Results
Rodriguez and Lazebnik (1999)
19Part III Model
20Technology - Framework
21Technology - Application
22Series of Models (I)
23Series of Models (II)
24To be continued (Apoptosis)
- Reversible Reactions
- Include different (cleaved) form of caspase 9
- Varying initial concentrations (of APAF1)
- Other reactants involved (e.g. XIAP)
25Possible Models
Reversible
Caspase 3 expanded
26Ongoing Research (Simpathica)
- Continuous vs Stochastic Models
- Spatial Models
- Numerical Integration
- Hybrid Systems
- Hierarchical Models
27Acknowledgements
- Bud Mishra Members of NYU Bioinformatics Group
- Shih-Chieh LIN, Yuri Lazebnik and Members of
Yuris lab at CSHL - Web-site http//www.bioinformatics.nyu.edu/
- Simpathica is supported by DARPA-BioSpice