|
|
| (6 intermediate revisions not shown) |
| Line 4: |
Line 4: |
| | <body id="Modeling"> | | <body id="Modeling"> |
| | <div id="cadre"> | | <div id="cadre"> |
| | + | <!--<section> |
| | + | <center> |
| | + | <a href="https://2012.igem.org/wiki/index.php?title=Team:Grenoble/Modeling/Amplification/ODE"><img src="https://static.igem.org/mediawiki/2012/e/ef/ODE.png" alt="" /></a> |
| | + | |
| | + | <a href="https://2012.igem.org/wiki/index.php?title=Team:Grenoble/Modeling/Amplification/Sensitivity"><img src="https://static.igem.org/mediawiki/2012/a/a4/Sensitivity_and_parameters.png" alt="" /></a> |
| | + | |
| | + | <a href="https://2012.igem.org/wiki/index.php?title=Team:Grenoble/Modeling/Amplification/Quorum"><img src="https://static.igem.org/mediawiki/2012/6/65/Quorum_Sensing.png" alt="" /></a> |
| | + | |
| | + | <a href="https://2012.igem.org/wiki/index.php?title=Team:Grenoble/Modeling/Amplification/Stochastic"><img src="https://static.igem.org/mediawiki/2012/a/ad/Stochastic_analysis.png" alt="" /></a> |
| | + | </center> |
| | + | </section>--> |
| | <section> | | <section> |
| - | <h1> Goal </h1> | + | <center> |
| - | </br> | + | <a href="https://2012.igem.org/ wiki/ index. php?title= Team: Grenoble/ Modeling/ Amplification/ Stochastic/ what"><img src="https://static.igem.org/mediawiki/2012/ d/ d9/ What.png" alt="" /></a> |
| - | Stochastic modeling is a technique of predicting outcomes that takes into account a certain degree of randomness or unpredictability. In a stochastic modeling, a small amount of randomness is added at each time step of the simulation.
| + | <a href="https://2012.igem.org/ Team: Grenoble/ Modeling/ Amplification/ Stochastic/ results"><img src="https://static.igem.org/mediawiki/2012/ 1/ 17/ Results.png" alt="" /></a> |
| - | </br>
| + | </center> |
| - | It is the probabilistic counterpart to a deterministic process.
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/3/38/Diagram_stoch.png" alt="" /></center>
| + | |
| - | <h1> Why </h1>
| + | |
| - | </br>
| + | |
| - | The deterministic model, who studies a population of bacteria, considers continuous concentrations of molecules. However, in a single bacteria, the quantity of the different proteins is of the order of 100, and the concentrations take thus discrete values. These values depend on events (production, degradation) which are hard to predict, and must therefore be approached in terms of probability of occurence (or preopensity).
| + | |
| - | </br>
| + | |
| - | </br>
| + | |
| - | <h1> How </h1>
| + | |
| - | </br>
| + | |
| - | A stochastic model incorporates random variations to predict future conditions and to see what they might be like.
| + | |
| - | </br>
| + | |
| - | To introduce that randomness we use a new function : propensities.
| + | |
| - | </br>
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/c/ca/Propensity.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | As an example, to illustrate this we consider 4 possible reactions. Each reaction has a probability to happen in the next time step.
| + | |
| - | </br>
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/8/8c/Reactions.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | We randomly chose the next reaction regarding the propensities.
| + | |
| - | </br>
| + | |
| - | </br>
| + | |
| - | When we run a stochastic simulation once, we get a trajectory. This graph represents the random evolution of the variables. Because of the randomness, if we run the script another time we will get a different trajectory. That is why to be able to interpret the results we have to run the cripts hundreds or thousands of times.
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/ 9/ 9c/ Curves.png" alt="" /></ center> | + | |
| - | </br>
| + | |
| - | Instead of describing a process which can only evolve in one way, in a stochastic or random process there is some indeterminacy : even if the initial condition is known, there are several directions in which the process may evolve.
| + | |
| - | </br>
| + | |
| - | </br> | + | |
| - | To model that randomness we use a Gillepsie algorithm or Stoachastic Simulation Algorithm (SSA).
| + | |
| - | </br>
| + | |
| - | </br>
| + | |
| - | </br>
| + | |
| - | Traditional continuous and deterministic biochemical rate equations do not accurately predict cellular reactions since they rely on random reactions that require the interactions of millions of molecules.
| + | |
| - | In contrast, the Gillespie algorithm allows a discrete and stochastic simulation of a system with few reactants because every molecule is explicitly simulated. When simulated, a Gillespie realization represents a random walk of the entire system.
| + | |
| - | </br>
| + | |
| - | </br>
| + | |
| - | We will use the following notations :
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/3/37/Assert.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | Each reaction Rj is characterized mathematically by two quantities :
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/5/50/State_change_vector.png" alt="" /></center>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/b/bc/Plot.png" alt="" /></center>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/ d/ d0/ Prop.png" alt="" /></ center> | + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/6/61/Prop2.png" alt="" /></center>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/f/f9/Prop4.png" alt="" /></center>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/0/09/Prop3.png" alt="" /></center>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/3/32/Prop5.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/e/e8/More_precisely.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | Once we have presented the theory behind the stochastic approach, let us have a look at the algorithm.
| + | |
| - | </br>
| + | |
| - | We can now describe the process of The Gillespie algorithm.
| + | |
| - | </br> | + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/f/f3/Iteration1.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/4/47/Iteration2.png" alt="" /></center>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/8/8c/Equations.png" alt="" /></center>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/8/86/Iteration3.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | The algorithm comprises 5 steps.
| + | |
| - | </br>
| + | |
| - | <center><img src="https://static.igem.org/mediawiki/2012/7/79/Scheme.png" alt="" /></center>
| + | |
| - | </br>
| + | |
| - | You can find our <b>script</b> for the stochastic modeling <a href="https://2012.igem.org/wiki/index.php?title=Team:Grenoble/Modeling/Amplification/Stochastic/Scripts">here</a>.
| + | |
| | </section> | | </section> |
| | </div> | | </div> |
"
