Difference between revisions of "Team:Paris Bettencourt/Modeling"
m |
|||
Line 19: | Line 19: | ||
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 | + | These reasons led us to write both a deterministic program based on the mass action law and a stochastic program based on the Gillespie’s stochastic |
− | simulation algorithm (SSA). With these two | + | simulation algorithm (SSA). With these two programs we obtain an accurate analysis of the vitamin production. |
<br /> | <br /> | ||
Line 140: | Line 140: | ||
<li>\([DC]_0 = 0\)</li> | <li>\([DC]_0 = 0\)</li> | ||
</ul> | </ul> | ||
− | We obtain the following graph with a simple MATLAB | + | We obtain the following graph with a simple MATLAB program available <a>here</a>. |
<br /> | <br /> | ||
<br /> | <br /> | ||
Line 221: | Line 221: | ||
<h5>Introduction</h5> | <h5>Introduction</h5> | ||
− | In the | + | In the program, each cell is a structure containing three elements : |
<ul> | <ul> | ||
<li>the cell type : | <li>the cell type : | ||
Line 242: | Line 242: | ||
<br /> | <br /> | ||
− | The time \(T_{i}\) for an event is chosen thanks to the | + | The time \(T_{i}\) for an event is chosen thanks to the equation \(11\) |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
<br /> | <br /> | ||
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. | ||
Line 270: | Line 258: | ||
<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 (divise 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 279: | Line 267: | ||
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 divise 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 divise. |
<br /> | <br /> | ||
<br /> | <br /> | ||
− | We define a new event and time event for the cell and for the new cell in case of | + | We define a new event and time event for the cell and for the new cell in case of division. |
<br /> | <br /> | ||
We also performed the number of vitamin calculus by numerically integrating the number of \(DC\). | We also performed the number of vitamin calculus by numerically integrating the number of \(DC\). |
Revision as of 13:44, 25 August 2015