|
|
(20 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>
| + | |
- | We have used a stochastic process because in one bacteria we don't have enough molecules to consider that one miological element has a continuous value. The behavior of those biological elements is regulated by probability laws.
| + | |
- | </br>
| + | |
- | In biology systems, introducing stochastic noise has been found to help improve the signal strength of the internal feedback loops for balance and other vestibular communication.
| + | |
- | </br>
| + | |
- | </br>
| + | |
- | <h1> How </h1>
| + | |
- | </br>
| + | |
- | Rather than using fixed variables such as in other mathematical modeling, 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>
| + | |
- | For example we take four possible reactions. Each reaction has a probability to happen in the next amount of time.
| + | |
- | </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 the script once, we get a graph. This graph represent the rando evolution of an element. Because of this randomness, if we run the script an other time we will get a different graph. 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>
| + | |
- | <h1> Gillespie _ Stochastic Simulation Algorithm </h1>
| + | |
- | </br>
| + | |
- | The Gillespie algorithm generates a statistically correct trajectory of a stochastic equation.
| + | |
- | </br>
| + | |
- | </br>
| + | |
- | Traditional continuous and deterministic biochemical rate equations do not accurately predict cellular reactions since they rely on bulk 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 assert :
| + | |
- | </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/9/9a/Change.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/0/09/Prop3.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/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 put the theory of the stochastic approach, we can determine the algorithm.
| + | |
- | </br>
| + | |
- | </br>
| + | |
- | <h1> One iteration of Gillespie algorithm </h1>
| + | |
- | </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> |