Team:ETH Zurich/Modeling/Framework
From 2008.igem.org
(→Detailed description of the Modeling Framework) |
(→Summary of the Algorithm and Interplay of Frameworks Componets) |
||
Line 31: | Line 31: | ||
First tree steps in the algorithm initialize and prepare the system for gene deletions and growth simulations. | First tree steps in the algorithm initialize and prepare the system for gene deletions and growth simulations. | ||
- | In the first step the genome data are analyzed in order to find a most suitable restriction enzyme for random fragments deletion using the “Restriction Enzyme Analysis”- procedure. For the second step the state-of-the art model is adjusted by introducing a selective pressure due to the genome size. Thirdly, initial population is set to consist of one type, namely | + | In the first step the genome data are analyzed in order to find a most suitable restriction enzyme for random fragments deletion using the “Restriction Enzyme Analysis”- procedure. For the second step the state-of-the-art model is adjusted by introducing a selective pressure due to the genome size. Thirdly, initial population is set to consist of one type, namely wild-type. |
The next steps of the algorithm perform in depth genome fragments deletion and growth simulation. | The next steps of the algorithm perform in depth genome fragments deletion and growth simulation. | ||
First, we simulate the restriction enzyme expression and the consecutive population decline and occurrence of new mutants with reduced genome. The growth rates of the latter can be predicted using Flux Balance Analysis. For these simulations we used the framework parts: “Switch generator” and “Flux Balance Analysis on a Genome Scale Model “. | First, we simulate the restriction enzyme expression and the consecutive population decline and occurrence of new mutants with reduced genome. The growth rates of the latter can be predicted using Flux Balance Analysis. For these simulations we used the framework parts: “Switch generator” and “Flux Balance Analysis on a Genome Scale Model “. | ||
Secondly, the growth simulations are performed using a chemostat model and the distribution of different mutant types according to the growth rates obtained. | Secondly, the growth simulations are performed using a chemostat model and the distribution of different mutant types according to the growth rates obtained. | ||
- | This simulation continues until no better mutants | + | This simulation continues until no better mutants are being generated. |
Eventually, the genome data of the fastest growing reduced genome mutant can be returned. | Eventually, the genome data of the fastest growing reduced genome mutant can be returned. |
Revision as of 22:36, 29 October 2008
We propose a novel method of random gene deletion and chemostat-based selection of species with a reduced genome. For this we provide an algorithm described below. Modeling FrameworkThis algorithm requires a modeling framework consisting of four main parts:
Detailed description of the Modeling Framework
Summary of the Algorithm and Interplay of Frameworks ComponetsFirst tree steps in the algorithm initialize and prepare the system for gene deletions and growth simulations. In the first step the genome data are analyzed in order to find a most suitable restriction enzyme for random fragments deletion using the “Restriction Enzyme Analysis”- procedure. For the second step the state-of-the-art model is adjusted by introducing a selective pressure due to the genome size. Thirdly, initial population is set to consist of one type, namely wild-type. The next steps of the algorithm perform in depth genome fragments deletion and growth simulation. First, we simulate the restriction enzyme expression and the consecutive population decline and occurrence of new mutants with reduced genome. The growth rates of the latter can be predicted using Flux Balance Analysis. For these simulations we used the framework parts: “Switch generator” and “Flux Balance Analysis on a Genome Scale Model “. Secondly, the growth simulations are performed using a chemostat model and the distribution of different mutant types according to the growth rates obtained. This simulation continues until no better mutants are being generated. Eventually, the genome data of the fastest growing reduced genome mutant can be returned. |