ComputationalSystemsBiology Paola Quaglia University of Trento and - - PowerPoint PPT Presentation

computational systems biology
SMART_READER_LITE
LIVE PREVIEW

ComputationalSystemsBiology Paola Quaglia University of Trento and - - PowerPoint PPT Presentation

ComputationalSystemsBiology Paola Quaglia University of Trento and CoSBi Agenda Deterministicchemicalkinetics Stochasticchemicalkinetics Simulation:Gillespiesdirectmethod


slide-1
SLIDE 1

ComputationalSystemsBiology

Paola Quaglia

University of Trento and CoSBi

slide-2
SLIDE 2
  • Deterministicchemicalkinetics
  • Stochasticchemicalkinetics
  • Simulation:Gillespie’sdirectmethod

Agenda

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

  • Simulation:Gillespie’sdirectmethod
  • BlenX:alanguageformodellingsystemdynamicswitha

stochasticrun$timesupportforsimulation

slide-3
SLIDE 3

Chemicalkinetics:reactions

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

n1 Y1 +...+nj Yj m1 X1 +...+mk Xk

slide-4
SLIDE 4

Reactions:terminology

Reactants

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

n1 Y1 +...+nj Yj m1 X1 +...+mk Xk

slide-5
SLIDE 5

Reactions:terminology

Reactants Products

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

n1 Y1 +...+nj Yj m1 X1 +...+mk Xk

slide-6
SLIDE 6

Reactions:terminology

Reactants Products

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

n1 Y1 +...+nj Yj m1 X1 +...+mk Xk

Stoichiometries

slide-7
SLIDE 7

Assumewehave:

  • awell$stirredandfixedvolumeVinthermalequilibrium;
  • Nchemicalspecies,eachwithaninitialnumberof

molecules;

  • Mreactionsthroughwhichthespeciescaninteract.

Generalquestion:

Deterministicapproach

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Generalquestion: Whichwillbethepopulationlevelsofspeciesafteraperiodof time? Thedeterministicapproachassumesthatthenumberof moleculesofthei$thspeciesattimetcanberepresented byacontinuousfunctionXi(t): dXi/dt=f(X1(t),...,XN(t))

slide-8
SLIDE 8

Lotka*Volterraprey*predatoreco*system

Example

Y 2Y Y+R 2R R Ø

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

YrepresentsthepreY,andRthepredatoR

  • 1. preyreproduction
  • 2. predatorreproduction,favouredbyfeedingonpreys
  • 3. predatornaturaldeath
slide-9
SLIDE 9

Deterministicformulation: Timeevolutionisawhollypredictableprocess,governedbya setofcoupledODEs. Inmanycasestimeevolutioncanbetreatedasa deterministic andcontinuous processwithanacceptable

Deterministicformulation

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

degreeofaccuracy,however:

  • Deterministicmodellingofabiologicalsystemrequiresthe

preciseknowledgeofmoleculardynamics(preciseposition andvelocityofeachmolecule).Athigherlevel(whenless detailsareknown),theevolutionisintrinsicallystochastic.

  • Timeevolutionisnotreallyacontinuousprocess:

populationlevelscanchangeonlyinadiscreteway.

slide-10
SLIDE 10

Stochasticformulation: Timeevolutionisarandom*walk process,governedbya singlestochasticdifferentialequation(). Thestochasticformulationhasafirmerphysicalkineticbasis

Stochasticformulation

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

thanthedeterministicformulation,andisespeciallyrelevant whendealingwithlowconcentrations. Thestochasticmasterequation,though,isveryoften mathematicallyintractable.

slide-11
SLIDE 11

Itisacomputationalmethod(analgorithm)whichtakes explicitaccountofthefactthattimeevolutionofspatially homogeneoussystemsisadiscrete (vs.continuous) stochastic (vs.deterministic)processandoffersan applicablealternativetothesolutionofthemasterequation.

Gillespie’sDirectMethod

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

References:

  • D.T.Gillespie,J.Comput.Phys.,vol.22,1976.
  • D.T.Gillespie,J.PhysicalChemistry,vol.81,1977.
slide-12
SLIDE 12

Themethodisimplementedtoanswerthe Generalquestion: IfNspeciescaninteractthroughoneofMreactionsinafixed volume,whichwillbethepopulationlevelsofspeciesaftera

Gillespie’sDirectMethod(ctd.)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

periodoftime? Thealgorithmgeneratesatrajectoryoftheevolutionofthe systems:itcalculateswhich reactionwilloccurnextand whenitwilloccur.

slide-13
SLIDE 13

Underlyingphysics:

  • reactionsarecollisions
  • moleculesarerandomlyanduniformlydistributedinthe

volume(assumingthesystembeinthermalequilibrium) FromthisGillespiearguesthat,althoughonecannotrigorously computethenumberofcollisionsoccurringinVbetween

Gillespie’sDirectMethod(ctd.)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

computethenumberofcollisionsoccurringinVbetween moleculesoftwogivenspecies,itispossibletoprecisely computetheprobabilityofsuchcollisionoccurringinany infinitesimaltimeinterval. Thenthekeypointofthemethodis: using insteadof

slide-14
SLIDE 14

GivenMreactionsR1,...,RM,thereexistMconstants,which

  • nlydependonthephysicalpropertiesoftheinvolved

moleculesandonthetemperatureofthesystem,suchthat: cj dt=average probabilitythataparticularcombination

  • fRjreactantswillreactinthenextinfinitesimal

timeintervaldt.

Gillespie’sDirectMethod(ctd.)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Why“average”? hj =numberofdistinctRj molecularreactantcombinationsinV attimet. cjhjdt istheprobabilitythatanRj reactionwilloccurin thenextinfinitesimaltimeinterval(t,t+dt).

slide-15
SLIDE 15

Computinghj isnothard:

  • Y...

h=|Y|

Gillespie’sDirectMethod(ctd.)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Y... h=|Y|

  • X+Y...

h=|X||Y| 2X... h=|X|(|X|$1)/2

slide-16
SLIDE 16

AttimeT,whatweneedtoknowtoimplementthenext simulationstepis:

  • whenthenextreactionwilloccur,
  • whichkindofreactionitwillbe.

Thisisaprobabilisticinformationgivenby:

Gillespie’sDirectMethod(ctd.)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

P(t,j)dt= probabilitythatattimetthenextreactionwill beaRjreactionandwilloccurinthe infinitesimalinterval(T+t,T+t+dt) =P(t,j)dt=aj exp($a0 t)(t≥0) where aj =cjhj anda0 =Σ j=1..M aj

slide-17
SLIDE 17

Simulation algorithm Initialization (set the values cj and the population levels) Compute a0 = Σ j=1..M aj Generate two random numbers n1,n2 in [0,1] and compute

  • t = (1/a0) ln (1/n1)
  • j such that Σk=1..j-1 aj < n2 a0 ≤ Σ k=1..j aj

Adjust population levels according to Rj and set T=T+t then iterate from step 2

slide-18
SLIDE 18

Stochasticprocesscalculi: formallanguagesforinteractingprocesses Basicingredients:

  • 1. asetofelementaryactionswithassociatedratevalues

(meaningthatthedelayofthecorrespondingactivityisa

ApplyingGillespie’smethodinprocesscalculi

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

(meaningthatthedelayofthecorrespondingactivityisa randomvariablewithanexponentialdistribution)

  • 2. alimitedsetofoperatorstospecify(atleast):

$ thetemporalorderingofactions $ possiblecoordination/interactionbetweenactions

slide-19
SLIDE 19

Theseformalismsare:

  • scalable(todescribephenomenafrombiochemistryupto

populationsofcells);

  • amenabletocomputerexecution(analysisand/or

simulation)

Applyingthemethodinprocesscalculi(ctd)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Averygoodpoint: Thesecalculicomewithanoperationalsemanticsthat easetherepresentationofprocessbehavioursasgraphs.

slide-20
SLIDE 20

Example:biochemicalstochasticpi*calculus (Priami,Regev,Silverman,Shapiro,2001)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

moreexamples: BioAmbients,Brane Calculi,CoreFormalBiology,Beta$binders,Bio$PEPA,...

slide-21
SLIDE 21
  • Deterministicchemicalkinetics
  • Stochasticchemicalkinetics
  • Simulation:Gillespie’sdirectmethod

Agenda

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

  • Simulation:Gillespie’sdirectmethod
  • BlenX:alanguageformodellingsystemdynamicswitha

stochasticrun$timesupportforsimulation

slide-22
SLIDE 22

BlenXisthekernelofaprogramminglanguagebasedon Beta$binders(PriamiandQuaglia,2004). Inturn,BlenXisthecoreofCoSBiLab.

BlenX

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

http://www.cosbi.eu

slide-23
SLIDE 23

Compiler Public Data Bases Literature

BlenX program

BlenX VL

CoSBiLab

supportsboth

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

BWB plotter MC SBML Run-time environment Sim CTMC React

supportsboth Gillespies’ssimulationsand spatialdiffusion visual,Markovchain,and SBMLexport

slide-24
SLIDE 24

Compiler

P-Systems Simulator

Concentration Time courses

Kinetic Inference

Public Data Bases Literature

BlenX program

BlenX VL

CoSBiLab

inferenceof quantitative parameters

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

BWB plotter MC SBML Run-time environment Sim CTMC React

Simulator

slide-25
SLIDE 25

Compiler

P-Systems Simulator

Concentration Time courses

Kinetic Inference

Public Data Bases Literature

BlenX program

BlenX VL

CoSBiLab

statistical analysisand visualization

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

BWB plotter MC SBML Run-time environment Sim CTMC React

Simulator Statistical Analysis

Internal Representation

Graphical Network Inspector

slide-26
SLIDE 26

Boxeswithtypedinteractionsites

MainingredientsofBlenX

P

x,A y,B z,C

Interfaces

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Internal process

P

  • interaction between two boxes is allowed over “affine” interfaces,

and is based on a race condition

  • complexation of two boxes is driven by the affinity of the relevant

sites

slide-27
SLIDE 27

Biologicalentities (mRNA,protein, ...) Boxes Interactioncapabilities (protein domains,...) Boxinteractionsites & Communication Interactionpotentials Affinityofinteractionsites

Biologicalinteractions

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Interactionpotentials Affinityofinteractionsites Complexation Linking boxestogetherinto graphs Decomplexation Removingedgesfromgraphs

slide-28
SLIDE 28

[steps=150000] letY:bproc=#(y,DY) [nil]; letR:bproc=#(r,DR) [nil];

Asimpleprogram

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

letYR:bproc=#(yr,DYR) [nil]; when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete; run1000Y||1000R||0YR

slide-29
SLIDE 29

[steps=150000] letY:bproc=#(y,DY) [nil]; letR:bproc=#(r,DR) [nil];

Asimpleprogram:structureoffile.prog

Preamble Declarations

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

letYR:bproc=#(yr,DYR) [nil]; when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete; run1000Y||1000R||0YR

Declarations Directives

slide-30
SLIDE 30

[steps=150000] letY:bproc=#(y,DY) [nil]; letR:bproc=#(r,DR) [nil];

Asimpleprogram:preamble

Simulationinformation [STEPS=10000] [TIME=70] [STEPS=7,DELTA=10] Globalstochasticrates

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

letYR:bproc=#(yr,DYR) [nil]; when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete; run1000Y||1000R||0YR

<< BASERATE:inf, >>

slide-31
SLIDE 31

[steps=150000] letY:bproc=#(y,DY) [nil]; letR:bproc=#(r,DR) [nil];

Asimpleprogram:boxdeclaration

nil nil

y,DY y,DY

nil nil

r,DR r,DR

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

letYR:bproc=#(yr,DYR) [nil]; when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete; run1000Y||1000R||0YR

nil nil

yr,DYR yr,DYR

nil isthesimplestinternalprocess

slide-32
SLIDE 32

[steps=150000] letY:bproc=#(y,DY) [nil]; letR:bproc=#(r,DR) [nil];

Asimpleprogram:eventsdeclaration

Events (split,join,delete)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

letYR:bproc=#(yr,DYR) [nil]; when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete; run1000Y||1000R||0YR

Events (split,join,delete) withassociatedrates

slide-33
SLIDE 33

Lotka*Volterra,computationally

when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete;

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

slide-34
SLIDE 34

Lotka*Volterra,computationally

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

slide-35
SLIDE 35

Simulationrun

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

slide-36
SLIDE 36

Communicationprimitivesforboth

  • interactionsbetweenboxes,and
  • interactionbetweenparallelsub$processeswithinthesame

box Bindingandunbindingofboxes

Morethanevents

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Foreachmodel: √file.prog file.types

slide-37
SLIDE 37

[steps=150000] letY:bproc=#(y,DY) [nil]; letR:bproc=#(r,DR) [nil];

Bindingandunbinding:file.types

{ DY, DR, DYR } %% { (DY,DR,0,0,0)

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

letYR:bproc=#(yr,DYR) [nil]; when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete; run1000Y||1000R||0YR (DY,DR,0,0,0) }

nobinding(norsubsequent unbinding)isallowed betweenYandR

slide-38
SLIDE 38

Bindingandunbinding:simpleexample

[steps=150000] letY:bproc =#(y,DY) [nil]; letR:bproc =#(r,DR) [nil]; { DY, DR, DYR } %% { (DY,DR,3,2,0) }

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

nil nil

y,DY y,DY

nil nil

r,DR r,DR letYR:bproc =#(yr,DYR) [nil]; when(Y::10)split(Y,Y); when(Y,R::0.01)join(YR); when(YR::inf)split(R,R); when(R::10)delete; run 1000Y||1000R||0YR }

slide-39
SLIDE 39

√ Events √Boxes Declarationsinfile.prog

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Internalprocesses

slide-40
SLIDE 40

Interfacemanagement:

Internalprocesses

x,DX x,DX y,DY y,DY z,DZ z,DZ

Interactionmanagement:

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Interfacemanagement: change(x,DX) expose(w,DW) hide(y) Interactionmanagement: x!<value>.P z?(parameter).P u!<value>.P u?(parameter).P P|Q P+Q if thenP

slide-41
SLIDE 41

Value*passing

y!<3>.nil y!<3>.nil

y,DY y,DY

r?(p).ifp>1thenP r?(p).ifp>1thenP

r,DR r,DR

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

nil nil

y,DY y,DY

if3>1thenP if3>1thenP

r,DR r,DR

slide-42
SLIDE 42

Filamentsaregeneratedfromaninitialfeed. FilamentscanbranchbycomplexationwithARPmolecules. Aminimumdistancebetweenadjacentbranchesisalways grantedbyaspecificinteractionprotocol.

Actinpolymerization

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

by Roberto Larcher

slide-43
SLIDE 43

Seeds: Otherelements:

Actinpolymerization

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

slide-44
SLIDE 44

Protocoltocontrolproximityofbranches

Actinpolymerization

distanceis:

1 2 1

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

1 2 1

slide-45
SLIDE 45

Polymerizationcomputationally

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

slide-46
SLIDE 46

PlantBioinformatics,SystemsandSyntheticBiologySummerSchool,Nottingham,July2009

Thanks!