• Keine Ergebnisse gefunden

Identifiability Analysis and Experimental Design for Dynamical Models in Systems Biology

N/A
N/A
Protected

Academic year: 2022

Aktie "Identifiability Analysis and Experimental Design for Dynamical Models in Systems Biology"

Copied!
39
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Identifiability Analysis and Experimental Design for Dynamical Models in Systems Biology

Jens Timmer

Center for Systems Biology

Center for Data Analysis and Modeling Center for Applied Biosciences

Bernstein Center for Computational Neuroscience Freiburg Institute for Advanced Studies

Department of Mathematics and Physics University of Freiburg

http://www.fdm.uni-freiburg.de/∼jeti/

(2)

Outline

• Systems Biology

• (Non-)Identifiability

• A New Method

(3)

Enlarging Math, Physics, Engineering

• Since Newton:

Mathematization of inanimate nature

• 21st century:

Additionally: Mathematization of animate nature

(4)

Man : A Dynamical System

Diseases caused or expressed by malfunction of dynamical processes

(5)

Two Directions in Systems Biology

• Putting all the omics together

So far: large scale, qualitative, static

• Understanding biomedical networks by data-based mathematical modelling of their dynamical behavior

So far: small scale, quantitative, dynamic

Both approaches will converge to: large scale, quantitative, dynamic

Common ground: Investigating networks

(6)

Our Direction in Systems Biology

Understanding biomedical systems by data-based mathematical modelling of their dynamical behavior From components and structure to behavior of networks

Systems Biology is based on but more than ...

... Mathematical Biology: Data-based

... Bioinformatics: Dynamics

... o.p./g. – o.p.: System

... another omics: Mathematics

(7)

Why Mathematical Modelling in BioMed?

Make assumptions explicit

Understand essential properties, failing models

Condense information, handle complexity

Understand role of dynamical processes, e.g. feed-back

Impossible experiments become possible

Prediction and control

Understand what is known

Discover general principles

”You don’t understand it until you can model it”

(8)

Why Modelling in Cell Biology?

• Basic Research

– Genomes are sequenced, but ...

– ... function determined by regulation – Regulation = Interaction & Dynamics – Function: Property of dynamic network – ”Systems Biology”

• Application

– Drug development takes 10 years and 1 bn $/e – Reduce effort by understanding systems

(9)

Examples of Networks I: Apoptosis

Pathway cartoon System’s behavior

Threshold behavior, one-way bistable

(10)

Examples of Networks II: MAP Kinase

Pathway cartoon System’s behavior

Time scales/parameters important

(11)

Where Do The Parameters Come From ?

Canonical form of models:

~x˙ = f~(~x, ~p, ~u)

• Function f~(.) from pathways cartoon

• Input ~u(t) measured

• Parameters ~p :

– ”Taken from the literature”

Problem: Different conditions, cell systems, ...

– Estimated from time-resolved, quantitative data Poses new challenges

(12)

The Systems Biology Cycle: A Process

Modelling

Hypotheses

Data

@

@

@

@

@

@

@

@

@

@

@

@

@ R

x = f~(~x, ~p, ~u) Dynamics ~x ∈ Rn+

~

y(ti) = ~g(~x(ti), ~p) Observations ~y ∈ Rm+

(13)

Parameter Estimation in Nonlinear

Partially Observed Noisy Dynamical Systems

Dynamics:

~x˙ = f~(~x, ~p, ~u) Observations:

~y(ti) = ~g(~x(ti), ~p) +~(ti), ~(ti) ∼ N(0, Σi)

Log-Likelihood:

χ2(~p, ~x(t0)) =

N

X

i=1 M

X

j=1

(yjD(ti) − gj(~x(ti; ~p, ~x(t0)) σi j

!2

(14)

Structural (Non-)Identifiability: Trivial Example

• Consider: y = a eb+cx = a eb ecx

• If fitted to data, only

d = a eb

can be determined, neither a nor b individually

• Relationship between non-ident. parameters: a = d e−b

• χ2(~p) = const for that relationship Practical non-identifiability:

Large confidence intervals due to poor data quality

(15)

Structural Identifiability: Non-Trivial Example

Swameye et al. PNAS 100, 2003, 1028-1033

(16)

Structural Identifiability: Non-Trivial Example

˙

x1 = 2p4xτ3 − p1x1EpoRA y1(ti) = p5 EpoRA(ti)

˙

x2 = p1x1EpoRA − p2x22 y2(ti) = p6(x2(ti) + 2 x3(ti))

˙

x3 = 1

2p2x22 − p3x3 y3(ti) = p7(x1(ti) + x2(ti) + 2 x3(ti))

˙

x4 = p3x3 − p4xτ3

Non-identifiable pairs:

p2 x1(0), p1/p5, p6/p2, p7/p2

(17)

Structural Identifiability: The Problem

Given:

x = f~(~x, ~p, ~u) Dynamics

~

y(ti) = ~g(~x(ti), ~p) Observations Question:

• Given {~u, ~f(.), ~g(.), ti}, can p~ be uniquely determined ? Existing methods:

• Analytical approaches: Only applicable to small systems

• Approximative methods: Hardly controllable

(18)

Non-Identifiability and Systems Analysis

• The model in itself is not the goal

• Goal: Systems analysis based on the model

Consequences of non-identifiability for systems analysis:

• Confidence intervals for identifiable parameters: possible

• Summation theorems: Not affected

• Predictions and extrapolations: It depends

Non-identifiability is coupled to non-observability

(19)

(Non-)Observability

Given:

x = f~(~x, ~p, ~u) Dynamics

~

y(ti) = ~g(~x(ti), ~p) Observations Question:

• Given {~u, ~f(.), ~g(.), ti}, can ~x(t) be uniquely determined ? If some pi are non-identifiable

=⇒

Some x (t) will be non-observable

(20)

Approximative Methods

• Structural non-identifiability:

∃ continuous set of parameters with constant χ2(p)

• Consider curvature H of χ2(ˆ~p)

H = ∂2 χ2(ˆ~p)

∂pi ∂pj , Asymp. confidence intervals from H−1

• Evaluate eigen-values of H:

Non-identifiabilities should correspond to zero eigen-values

• Problem: Non-linearity of the parameter relationships

(21)

Approximative Methods: Example

χ2-landscape, non-identifiability: p1 p2 = const

p

p 2

0 0.2 0.4 0.6 0.8 1

0 0.5 1 1.5 2 2.5 3

(22)

The Idea of the New Method

Structural non-identifiability:

• Functional relationships between parameters

• χ2(~p) does not change along these relationships

Idea: Do changes of ~pˆ exist that do not change χ2(~p) ?

(23)

Profile Likelihood and Confidence Regions

• Profile likelihood:

P Li : χ2(pi) = min

pj6=i2(~p)]

Likelihood of pi with all other parameters re-optimized

• Confidence regions determined by increase of likelihood χ2(~p) − χ2(ˆ~p) < χ2(1−α,r)

r = 1 pointwise, r = #p simultaneous confidence regions

(24)

Confidence Regions and Profile Likelihood

χ2-landscape

Asymp. CR Likelihood CR Profile likelihood

p1

p 2

0 0.01 0.02 0.03 0.04 0.05

−0.4

−0.2 0 0.2 0.4 0.6 0.8 1 1.2

(25)

Structural and Practical Identifiability

Consider threshold Θ = χ2(ˆ~p) + χ2(1−α,r)

• Structural and practical identifiable:

– P Li crosses Θ for pˆi − σ and pˆi + σ+

– [ ˆpi − σ, pˆi + σ+] represent confidence intervals

• Structural non-identifiable: P Li = const

• Practical non-identifiable:

P Li 6= const, σ+ and/or σ = ∞ (on log. scale)

(26)

The Three Cases

identifiable structural non-identifiable practical non-identifiable

ï0.5 0 0.5 1 1.5 2

5.5 6 6.5 7 7.5 8 8.5 9

r2

p1

(27)

Find Functional Relationships

If one non-identifiable parameter pi is identified:

• Plot all other parameters in dependence of pi

(28)

An Example: JAK-STAT pathway

STAT (x1)

npSTAT_npSTAT (x4)

p1

p2

p3 p4

pEpoR (u)

pSTAT (x2)

pSTAT_pSTAT (x3)

s1 s2

0 10 20 30 40 50 60

0 0.2 0.4 0.6 0.8 1

time / min y 2 / a.u.

0 10 20 30 40 50 60

0 0.2 0.4 0.6 0.8 1

time / min

u / a.u.

0 10 20 30 40 50 60

0 0.2 0.4 0.6 0.8 1

time / min y 1 / a.u.

(29)

Profile Likelihood

!"# !"$

$!

$%

%!

!# ! !& ! & !'# !'( !'# !'( !!'$ ! !!'( !!'#

!! "#

!"#

$%&'

$&%(( !"#

$%&)

*(

!"#

$%&)

$(

!"#

$%&+

,(

!"#

$%&+

-(

!"#

$%&+

*(

!"#

$%&+

$(

(30)

Relations of Non-Identifiable Parameters

!! !" !# $ #

!%

!"

$

"

%

&'(#$)*"+

&'( #$)',-./0*1/12.,./3+

0

0

$ $4" $4% $45

!#46

!#

!$46

$

$46

&'(#$)7#)$++

0

0

!$45 !$4% !$4" $

!#46

!#

!$46

$

$46

#

&'(#$)3"+ 0

0

!$45 !$4% !$4" $ $4"

!#46

!#

!$46

$

$46

#

&'(#$)3#+ 0

0

!"

!#

!$

!%

&"'()

*"

*#

(31)

Non-Observability

Non-observability due to structural non-identifiability

0 20 40 60

0 2 4

time / min x 1 / nM

0 20 40 60

0 1 2

time / min x 2 / nM

0 20 40 60

0 0.2 0.4 0.6

time / min x 3 / nM

0 20 40 60

0 0.1 0.2

time / min x 4 / nM

(32)

Non-Observability

Non-observability due to practical non-identifiability of p3

0 20 40 60

0 0.5 1

time / min y 1 / a.u.

0 20 40 60

0 0.5 1 1.5 2

time / min x 1 / nM

0 20 40 60

0 0.5 1 1.5

time / min x 2 / nM

0 20 40 60

0 0.2 0.4 0.6 0.8

time / min x 3 / nM

0 20 40 60

0 0.05 0.1

time / min x 4 / nM

0 20 40 60

0 0.5 1

time / min

y 2 / a.u. nM nM

(33)

Experimental Design

Observability analysis suggests two additional measurements

• x1(0) = 200 ± 20nM

• x3/(x2 + x3) = 0.9 ± 0.05nM at t = 20 min

!"# !"$

$!

$%

%!

!# ! !& ! & !'# !'( !'# !'( !!'$ ! !!'( !!'#

#'# #'$ !#"# !# !#'$ !#'#

!"# !"$

!& !!"1

!# ! #

!"# !"$

$!

$%

%!

!! "#!! "#

(34)

Properties of the Method

• No assumptions about functional form of non-identifability

• Applicable to large systems

• Applicable to any kind of parameter estimation problem – Ordinary differential equations

– Stochastic differential equations – Partial differential equations

– Any continuous parameter estimation problem

(35)

Benefit

• Experimental design: What to measure when ?

• Model reduction: Lump processes/parameters Goals:

• Tailor model complexity to information content of data

• Turn all parameters identifiable

• Turn all experimentally unobserved components observable

• Obtain reliable model predictions

(36)

Papers and Software

A. Raue, C. Kreutz, T. Maiwald, J. Bachmann, M. Schilling, U. Klingm¨uller, J. Timmer Structural and practical identifiability analysis of partially observed dynamical models by exploiting the profile likelihood. Bioinformatics, 25, 2009, 1923-1929

Hengl S., Kreutz C., Timmer J. Maiwald T

Data-dased identifiability analysis of nonlinear dynamical models. Bioinformatics 23, 2007, 2612-2618

Both methods are included in modelling software PottersWheel: www.potterswheel.de T. Maiwald, J. Timmer

Dynamical modeling and multi-experiment fitting with PottersWheel. Bioinformatics 24, 2008, 2037-2043

(37)

Summary: The Two Systems Biology Cycles

Modelling

Hypotheses

Data

A

A A

A A

A A

A A

A U

Experimental Design

Data

Identifiability Analysis

A A

A A

A A

A A

A A U

(38)

Acknowledgements

Theoretical side Experimental side DKFZ, Heidelberg

Andreas Raue Verena Becker

Thomas Maiwald Marcel Schilling Clemens Kreutz Julie Bachmann Ursula Klingm¨uller

(39)

SBMC 2010

3rd Conference “Systems Biology of Mammalian Cells”

June 3-5, 2010 Freiburg, Germany www.sbmc2010.de

Referenzen

ÄHNLICHE DOKUMENTE

Asymptotic Stability and Lyapunov’s Stability Theory Dynamical systems implemented by neural networks have been advocated as a powerful means to model robot motions [8], [19], but

Part II Resources Supporting Bioinformatics and Systems Biology Research 5 Databases, Computational Tools and Services

In various robotics projects we have developed MontiArcAutomaton (code) generators for EMF Ecore 1 for graphical editing within Eclipse, Mona [EKM98] theories for verification

These include (a) studies of development and gene expression in worms and flies, (b) the biophysics of mitosis, (c) neural patterning in flies and mice, and (d) the interpretation

Kang, B., Park, G.: Optimization of Flexible Multibody Dynamic Systems Using the Equivalent Static Load Method. AIAA

As another example of interval problems we shall briefly consider boundary value problems ( B V P ) for partial differential equations ( P D E ) involving

The statistical approach t o data processing and sequential testing has a long tradi- tion. The main criticism of statistical methods comes from the fact that some of the

– an AI system based on declarative knowledge might just contain a map of the building, together with information about the basic actions that can be done by the robot (like