Difference between revisions of "Team:Paris Bettencourt/Modeling"
(Seems to be the final version!) |
m |
||
Line 2: | Line 2: | ||
{{Paris_Bettencourt/menu}} | {{Paris_Bettencourt/menu}} | ||
{{Paris_Bettencourt/modelingBanner}} | {{Paris_Bettencourt/modelingBanner}} | ||
− | |||
<html> | <html> | ||
Line 8: | Line 7: | ||
<h3>Introduction</h3> | <h3>Introduction</h3> | ||
− | Based on a set of ordinary differential equations (ODE) describing the kinetics of the cells differentiation, we designed a model to find the best | + | Based on a set of ordinary differential equations (ODE) describing the kinetics of the cells' differentiation, we designed a model to find the best |
differentiation rate. | differentiation rate. | ||
<br /> | <br /> | ||
− | First we developed a deterministic algorithm based on the ordinary differential equations solutions. | + | First we developed a deterministic algorithm based on the ordinary differential equations' solutions. |
<br /> | <br /> | ||
− | Then we | + | Then we found out that a stochastic algorithm could be another solution to solve our problem. |
<br /> | <br /> | ||
<br /> | <br /> | ||
− | For system involving large cell counts, the ordinary differential equations model | + | For system involving large cell counts, the ordinary differential equations model gives an accurate representation of the behavior. But with small cell |
counts, the stochastic and discrete method has a significant influence on the observed behaviour. | counts, the stochastic and discrete method has a significant influence on the observed behaviour. | ||
<br /> | <br /> | ||
− | These reasons led us to write both a deterministic program based on the mass action law and a stochastic program based on | + | These reasons led us to write both a deterministic program based on the mass action law and a stochastic program based on Gillespie’s stochastic |
simulation algorithm (SSA). With these two programs we obtain an accurate analysis of the vitamin production. | simulation algorithm (SSA). With these two programs we obtain an accurate analysis of the vitamin production. | ||
<br /> | <br /> | ||
Line 124: | Line 123: | ||
<br /> | <br /> | ||
\(t\), \(k_{2}\), \(k_{3}\) and \(k_{4}\) are constants. \(MC_0\) and \(DC_0\) are not relevant parameters. It seems logical that the | \(t\), \(k_{2}\), \(k_{3}\) and \(k_{4}\) are constants. \(MC_0\) and \(DC_0\) are not relevant parameters. It seems logical that the | ||
− | more cells are in the medium, the more | + | more cells are in the medium, the more vitamins are produced. |
<br /> | <br /> | ||
However, it could be interesting to compare different \(\frac{MC_0}{DC_0}\) ratios but we prefer to focus on the rate constant \(k_{1}\). | However, it could be interesting to compare different \(\frac{MC_0}{DC_0}\) ratios but we prefer to focus on the rate constant \(k_{1}\). | ||
Line 130: | Line 129: | ||
We try to find the best \(k_{1}\). To this end we maximize the vitamin function numerically with MATLAB. | We try to find the best \(k_{1}\). To this end we maximize the vitamin function numerically with MATLAB. | ||
<br /> | <br /> | ||
− | As an example, | + | As an example, let's consider the following parameters. |
<br /> | <br /> | ||
<ul> | <ul> | ||
Line 140: | Line 139: | ||
<li>\(DC_0 = 0 \phantom{t} (cells)\)</li> | <li>\(DC_0 = 0 \phantom{t} (cells)\)</li> | ||
</ul> | </ul> | ||
− | We obtain the following graph with a simple MATLAB program available | + | We obtain the following graph with a simple MATLAB program available on the <a href="https://2015.igem.org/Team:Paris_Bettencourt/Software" title="Software wiki page" >software wiki page</a>. |
<br /> | <br /> | ||
<br /> | <br /> | ||
Line 149: | Line 148: | ||
We noticed that two different \(k_{1}\) exist to optimize the maximum number of differentiated cell \(DC\) or the maximum number of \(Vitamin\). | We noticed that two different \(k_{1}\) exist to optimize the maximum number of differentiated cell \(DC\) or the maximum number of \(Vitamin\). | ||
<br /> | <br /> | ||
− | In our case, we chose of course the \(k_{1}\) that | + | In our case, we chose of course the \(k_{1}\) that optimizes the vitamin production <i>i.e.</i> \(k_{1} = 0.207\). |
<h4>Deterministic evolution of mother cell, differentiated cell and vitamin numbers</h4> | <h4>Deterministic evolution of mother cell, differentiated cell and vitamin numbers</h4> | ||
We wrote a deterministic algorithm with MATLAB using the previous solutions \((8)\), \((9)\) and \((10)\). For those interested, the source code is available in the <a href="https://2015.igem.org/Team:Paris_Bettencourt/Software" title="Software wiki page" >software wiki page</a>. | We wrote a deterministic algorithm with MATLAB using the previous solutions \((8)\), \((9)\) and \((10)\). For those interested, the source code is available in the <a href="https://2015.igem.org/Team:Paris_Bettencourt/Software" title="Software wiki page" >software wiki page</a>. | ||
<br /> | <br /> | ||
− | In order to optimize the vitamin production, we use the same parameters as previously and set \(k_{1}\) with the previous resulting value <i> | + | In order to optimize the vitamin production, we use the same parameters as previously and set \(k_{1}\) with the previous resulting value <i>i.e.</i> \(k_{1} = |
0.207 (hours^{-1})\). | 0.207 (hours^{-1})\). | ||
<br /> | <br /> | ||
Line 230: | Line 229: | ||
<li>the next event type. | <li>the next event type. | ||
<ul> | <ul> | ||
− | <li>1 : a mother cell | + | <li>1 : a mother cell becomes a differentiated cell.</li> |
− | <li>2 : a mother cell | + | <li>2 : a mother cell divides into two mother cells.</li> |
− | <li>3 : a differentiated cell | + | <li>3 : a differentiated cell divides into two differentiated cells.</li> |
</ul> | </ul> | ||
Line 245: | Line 244: | ||
There is a competition between the first two events concerning the mother cell. | There is a competition between the first two events concerning the mother cell. | ||
<br /> | <br /> | ||
− | Either the mother cell | + | Either the mother cell differentiates or it divides into two differentiated cells. |
<br /> | <br /> | ||
To do the choice we compare \(T_{1}\) and \(T_{2}\). The smallest time is the next event time. | To do the choice we compare \(T_{1}\) and \(T_{2}\). The smallest time is the next event time. | ||
Line 257: | Line 256: | ||
<br /> | <br /> | ||
<h5>Step 2 : Choose the next event among all cells.</h5> | <h5>Step 2 : Choose the next event among all cells.</h5> | ||
− | We have an array containing all the cells. Each cell | + | We have an array containing all the cells. Each cell contains the time before its next event (divide or differentiate). |
<br /> | <br /> | ||
The next event time processed by the algorithm is the smallest cell next event time. | The next event time processed by the algorithm is the smallest cell next event time. | ||
Line 308: | Line 307: | ||
<h5>Step 5 : Go to step 2 until the simulation time is superior to the fermentation period.</h5> | <h5>Step 5 : Go to step 2 until the simulation time is superior to the fermentation period.</h5> | ||
We do this process until the simulation time is superior to the fermentation period. | We do this process until the simulation time is superior to the fermentation period. | ||
− | The number of cells | + | The number of cells increases with an exponential law. The computational power increases with the same law. |
<br /> | <br /> | ||
− | Do not try to | + | Do not try to process a long simulation time if your computer is not powerful. |
<h5>Step 6 : Show the results.</h5> | <h5>Step 6 : Show the results.</h5> | ||
Here is a graph generated by the stochastic algorithm. | Here is a graph generated by the stochastic algorithm. | ||
Line 424: | Line 423: | ||
<h3>Conclusion</h3> | <h3>Conclusion</h3> | ||
− | As we can see, the stochastic and the deterministic models | + | As we can see, the stochastic and the deterministic models provide <i>a priori</i> different results. |
It seems logical because of the statistical nature of the problem. | It seems logical because of the statistical nature of the problem. | ||
<br /> | <br /> | ||
− | However, the comparison of the two graphs | + | However, the comparison of the two graphs gives us useful and accurate information about the vitamin optimization. |
<br /> | <br /> | ||
Because of small cell counts, the stochastic and discrete method has a significant influence on the observed behaviour. | Because of small cell counts, the stochastic and discrete method has a significant influence on the observed behaviour. | ||
<br /> | <br /> | ||
− | <i>In vivo</i>, the | + | <i>In vivo</i>, the cell population likely follows the stochastic model. |
We are waiting for laboratory results to confirm or disprove our model. | We are waiting for laboratory results to confirm or disprove our model. | ||
<br /> | <br /> | ||
Line 437: | Line 436: | ||
<h3>MATLAB algorithm</h3> | <h3>MATLAB algorithm</h3> | ||
− | In order to make this model and code accessible, understandable and editable by everyone, we have | + | In order to make this model and code accessible, understandable and editable by everyone, we have created a <a href="https://2015.igem.org/Team:Paris_Bettencourt/Software" title="Software wiki page" >software wiki page</a>. |
<br /> | <br /> | ||
Feel free to download the <a href="https://github.com/iGEMParisBettencourt2015" title="Source code in GitHub" >source code</a> in GitHub, modify it and make it accessible for everyone. | Feel free to download the <a href="https://github.com/iGEMParisBettencourt2015" title="Source code in GitHub" >source code</a> in GitHub, modify it and make it accessible for everyone. |
Revision as of 19:33, 17 September 2015