Difference between revisions of "Team:Paris Bettencourt/Modeling"
m |
|||
(9 intermediate revisions by 4 users not shown) | |||
Line 1: | Line 1: | ||
{{Paris_Bettencourt/header}} | {{Paris_Bettencourt/header}} | ||
{{Paris_Bettencourt/menu}} | {{Paris_Bettencourt/menu}} | ||
− | {{Paris_Bettencourt/ | + | {{Paris_Bettencourt/banner|page_id=modeling|page_name=Modeling}} |
<html> | <html> | ||
Line 9: | Line 9: | ||
<h2>Introduction</h2> | <h2>Introduction</h2> | ||
− | Based on a set of ordinary differential equations (ODE) describing the kinetics of | + | <div class="column-left"> |
− | differentiation rate. | + | Based on a set of ordinary differential equations (ODE) describing the kinetics of cell differentiation, we designed a model to find the best differentiation rate. |
<br /> | <br /> | ||
− | First we developed a deterministic algorithm based on the ordinary differential | + | First we developed a deterministic algorithm based on the ordinary differential equation. |
<br /> | <br /> | ||
Then we found out that a stochastic algorithm could be another solution to solve our problem. | 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 gives an accurate representation of the behavior. But with small cell | + | </div> |
− | counts, the stochastic and discrete method has a significant influence on the observed behaviour. | + | |
+ | <div class="column-right"> | ||
+ | For a 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. | ||
<br /> | <br /> | ||
− | + | This 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 vitamin production. | |
− | simulation algorithm (SSA). With these two programs we obtain an accurate analysis of | + | |
<br /> | <br /> | ||
+ | </div> | ||
<h2>Deterministic model</h2> | <h2>Deterministic model</h2> | ||
Line 28: | Line 30: | ||
We conceived a simple model with the minimum number of parameters. | We conceived a simple model with the minimum number of parameters. | ||
<br /> | <br /> | ||
− | We | + | We found seven significant parameters for our model. |
<br /> | <br /> | ||
<ul> | <ul> | ||
Line 121: | Line 123: | ||
\] | \] | ||
+ | </br> | ||
<h3>Vitamin optimization</h3> | <h3>Vitamin optimization</h3> | ||
Our goal is to optimize the vitamin production. We can only change three parameters : \(k_{1}\), \(MC_0\) and \(DC_0\). | Our goal is to optimize the vitamin production. We can only change three parameters : \(k_{1}\), \(MC_0\) and \(DC_0\). | ||
Line 151: | Line 154: | ||
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 optimizes the vitamin production <i>i.e.</i> \(k_{1} = 0.207\). | + | In our case, we chose of course the \(k_{1}\) that optimizes the vitamin production <i>i.e.</i> \(k_{1} = 0.207 \phantom{t} (hours^{-1})\). |
<h3>Deterministic evolution of mother cell, differentiated cell and vitamin numbers</h3> | <h3>Deterministic evolution of mother cell, differentiated cell and vitamin numbers</h3> | ||
We wrote a deterministic algorithm with MATLAB using the previous solutions \((8)\), \((9)\) and \((10)\). For those interested, the source code is available on the software section. | We wrote a deterministic algorithm with MATLAB using the previous solutions \((8)\), \((9)\) and \((10)\). For those interested, the source code is available on the software section. | ||
<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>i.e.</i> \(k_{1} = | 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 \phantom{t} (hours^{-1})\). |
<br /> | <br /> | ||
We obtain the following graph. | We obtain the following graph. | ||
Line 168: | Line 171: | ||
<br /> | <br /> | ||
This result seems relevant. The model does not take into account the cells' death and the nutrients present in the medium. | This result seems relevant. The model does not take into account the cells' death and the nutrients present in the medium. | ||
− | + | </d> | |
<h2>Stochastic model</h2> | <h2>Stochastic model</h2> | ||
Line 299: | Line 302: | ||
\[ | \[ | ||
\begin{align} | \begin{align} | ||
− | T_{event cell} = T_{event cell} - T_{i} | + | T_{event \phantom{t} cell} = T_{event \phantom{t} cell} - T_{i} |
\end{align} | \end{align} | ||
\] | \] | ||
Line 306: | Line 309: | ||
<ul> | <ul> | ||
<li>\(T_{i}\) : time of the next event being performed.</li> | <li>\(T_{i}\) : time of the next event being performed.</li> | ||
− | <li>\(T_{event cell}\) : cell next time event.</li> | + | <li>\(T_{event \phantom{t} cell}\) : cell next time event.</li> |
</ul> | </ul> | ||
Line 451: | Line 454: | ||
<h2>Introduction</h2> | <h2>Introduction</h2> | ||
− | As explained | + | As explained in the modeling section, this program models the cell population evolution with mother cell differentiation and cell division. |
<br /> | <br /> | ||
In order to make this model and code accessible, understandable and editable by everyone, we have created this software section. | In order to make this model and code accessible, understandable and editable by everyone, we have created this software section. | ||
Line 781: | Line 784: | ||
For more information concerning the model see the modeling section. | For more information concerning the model see the modeling section. | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
</html> | </html> | ||
{{Paris_Bettencourt/footer}} | {{Paris_Bettencourt/footer}} |
Latest revision as of 18:44, 28 October 2015