Difference between revisions of "Team:Paris Bettencourt/Modeling"
Line 14: | Line 14: | ||
We find out that a stochastic algorithm is an other solution to solve our problem. | We find out that a stochastic algorithm is an other solution to solve our problem. | ||
<br /> | <br /> | ||
− | For system involving large cell counts, the ordinary differential equations model give an accurate representation of the behavior. But with small cell counts , the | + | For system involving large cell counts, the ordinary differential equations model give an accurate representation of the behavior. But with small cell counts |
+ | , the | ||
stochastic and | stochastic and | ||
discrete method has a significant influence on the observed behaviour. | discrete method has a significant influence on the observed behaviour. | ||
Line 26: | Line 27: | ||
We try to design a simple model with the minimum amount of parameters. | We try to design a simple model with the minimum amount of parameters. | ||
− | |||
<br /> | <br /> | ||
<ul> | <ul> | ||
Line 104: | Line 104: | ||
\\ | \\ | ||
\\ | \\ | ||
− | [DC]_{0}.\frac{k_{4}}{k_{3}}.(e^{k_{3}.t} - 1) + [MC]_{0}.\frac{k_{4}}{k_{3}}.(k_{3}.t - 1).(\frac{k_{2}}{k_{3}} - 1).(e^{k_{3}.t} - 1) + [MC]_{0}.\frac{k_{4}}{k_{3}}.(\frac{k_{2}}{k_{3}} - 1) & | + | [DC]_{0}.\frac{k_{4}}{k_{3}}.(e^{k_{3}.t} - 1) + [MC]_{0}.\frac{k_{4}}{k_{3}}.(k_{3}.t - 1).(\frac{k_{2}}{k_{3}} - 1).(e^{k_{3}.t} - 1) + |
+ | [MC]_{0}.\frac{k_{4}}{k_{3}}.(\frac{k_{2}}{k_{3}} - 1) & | ||
\mbox{if } k_{1} = k_{3} - k_{2} | \mbox{if } k_{1} = k_{3} - k_{2} | ||
\end{cases} | \end{cases} | ||
Line 113: | Line 114: | ||
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\). | ||
<br /> | <br /> | ||
− | \(t\), \(k_{2}\), \(k_{3}\) and \(k_{4}\) are constants. \([MC]_0\) and \([DC]_0\) are, in fact, not relevent parameters because it seems logical that the more cell you have, the more vitamin you product. | + | \(t\), \(k_{2}\), \(k_{3}\) and \(k_{4}\) are constants. \([MC]_0\) and \([DC]_0\) are, in fact, not relevent parameters because it seems logical that the |
+ | more cell you have, the more vitamin you product. | ||
<br /> | <br /> | ||
However, it could be interesting to compare different \(\frac{[MC]_0}{[DC]_0}\) ratio but we prefer to focus on the rate constant \(k_{1}\). | However, it could be interesting to compare different \(\frac{[MC]_0}{[DC]_0}\) ratio but we prefer to focus on the rate constant \(k_{1}\). | ||
<br /> | <br /> | ||
We try to find the best \(k_{1}\). We maximize the vitamin function numerically with MATLAB. | We try to find the best \(k_{1}\). We maximize the vitamin function numerically with MATLAB. | ||
+ | <br /> | ||
+ | This is a graph example obtained with a simple MATLAB programm disponible <a>here</a>. | ||
<br /> | <br /> | ||
<br /> | <br /> | ||
+ | <img src="https://static.igem.org/mediawiki/2015/4/45/OptimizeK1.png" alt="Vitamin optimization" style="align:center;"> | ||
<br /> | <br /> | ||
<br /> | <br /> | ||
− | + | As you can see, we are able to find the best \(k_{1}\) to optimize the vitamin production. | |
<br /> | <br /> | ||
+ | We notice that two differents \(k_{1}\) exists to optimize the maximum concentration of differentiate cell \([DC]\) or the maximum concentration of vitamin | ||
+ | \([Vitamin]\). | ||
<h4>Results</h4> | <h4>Results</h4> |
Revision as of 20:40, 14 August 2015