Difference between revisions of "Team:Paris Bettencourt/Modeling"
m |
(Seems to be the final version!) |
||
Line 245: | Line 245: | ||
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 differentiate | + | Either the mother cell differentiate or it divide into two differentiated cells. |
<br /> | <br /> | ||
− | To do the choice | + | To do the choice we compare \(T_{1}\) and \(T_{2}\). The smallest time is the next event time. |
<br /> | <br /> | ||
<img src="https://static.igem.org/mediawiki/2015/7/72/GeneralStochasticAlgorithm.png" height="420" style="float:right;" alt="Algorithm flowchart" title="Algorithm flowchart" > | <img src="https://static.igem.org/mediawiki/2015/7/72/GeneralStochasticAlgorithm.png" height="420" style="float:right;" alt="Algorithm flowchart" title="Algorithm flowchart" > | ||
− | <h5>Step 1 : Initialize the cells</h5> | + | <h5>Step 1 : Initialize the cells.</h5> |
First of all we have to generate the first cells in accordance with \(MC_0\) and \(DC_0\). | First of all we have to generate the first cells in accordance with \(MC_0\) and \(DC_0\). | ||
<br /> | <br /> | ||
For each cell we set the cell type, the next event and the time before the next event. | For each cell we set the cell type, the next event and the time before the next event. | ||
<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 contain the time before his next event ( | + | We have an array containing all the cells. Each cell contain the time before his 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. | ||
<br /> | <br /> | ||
− | <h5>Step 3 : Do the next event</h5> | + | <h5>Step 3 : Do the next event.</h5> |
Now that we know the next event type and the concerned cell (only one cell is involved here), we compute this event. | Now that we know the next event type and the concerned cell (only one cell is involved here), we compute this event. | ||
<br /> | <br /> | ||
As explained above, we have three choices. | As explained above, we have three choices. | ||
<br /> | <br /> | ||
− | If the cell is a mother cell, the cell can | + | If the cell is a mother cell, the cell can divide or differentiate. |
<br /> | <br /> | ||
− | If the cell is a differentiate cell, the cell can only | + | If the cell is a differentiate cell, the cell can only divide. |
<br /> | <br /> | ||
<br /> | <br /> | ||
Line 291: | Line 291: | ||
</ul> | </ul> | ||
− | <h5>Step 4 : Update the simulation time</h5> | + | <h5>Step 4 : Update the simulation time.</h5> |
For each cell except the concerned cell, define the cell next event time with the following formula. | For each cell except the concerned cell, define the cell next event time with the following formula. | ||
Line 307: | 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 | + | We do this process until the simulation time is superior to the fermentation period. |
− | + | The number of cells increase with an exponential law. The computational power increase with the same law. | |
<br /> | <br /> | ||
Do not try to processed a long simulation time if your computer is not powerful. | Do not try to processed 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 | + | Here is a graph generated by the stochastic algorithm. |
<br /> | <br /> | ||
<br /> | <br /> | ||
Line 323: | Line 323: | ||
<h4>Vitamin optimization</h4> | <h4>Vitamin optimization</h4> | ||
− | Like the deterministic model | + | Like the deterministic model our goal is to maximize the vitamin production. |
<br /> | <br /> | ||
In order to get relevant results, we average by doing a large number of simulations specified by the \(Averaging\) \(number\) parameter. | In order to get relevant results, we average by doing a large number of simulations specified by the \(Averaging\) \(number\) parameter. | ||
Line 363: | Line 363: | ||
<img width="100%" src="https://static.igem.org/mediawiki/2015/3/3c/CompareStochasticAndDeterministic.png" title="Comparison of deterministic and stochastic vitamin optimization" alt="Comparison of deterministic and stochastic vitamin optimization" style="align:center;"> | <img width="100%" src="https://static.igem.org/mediawiki/2015/3/3c/CompareStochasticAndDeterministic.png" title="Comparison of deterministic and stochastic vitamin optimization" alt="Comparison of deterministic and stochastic vitamin optimization" style="align:center;"> | ||
<br /> | <br /> | ||
− | We performed cross-correlation and correlation | + | We performed a cross-correlation and found correlation coefficients between the two graphs with the <a href="http://fr.mathworks.com/help/signal/ref/xcorr.html">xcorr</a> and <a href="http://fr.mathworks.com/help/images/ref/corr2.html">corr2</a> MATLAB functions. |
<br /> | <br /> | ||
<br /> | <br /> | ||
Line 439: | Line 439: | ||
In order to make this model and code accessible, understandable and editable by everyone, we have ceated a <a href="https://2015.igem.org/Team:Paris_Bettencourt/Software" title="Software wiki page" >software wiki page</a>. | In order to make this model and code accessible, understandable and editable by everyone, we have ceated 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 source code, 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. |
<h3>Bibliography</h3> | <h3>Bibliography</h3> |
Revision as of 15:46, 12 September 2015