Team:Warsaw/ExpressionAdaptors/Solution
From 2011.igem.org
(Difference between revisions)
Line 28: | Line 28: | ||
</ul> | </ul> | ||
</div> | </div> | ||
+ | |||
+ | <h2>Computational design of the expression adapters</h2> | ||
+ | |||
+ | <div> | ||
+ | Expression adapters were created by a genetic algorithm that we designed specifically for this task. It generates random 5 bp spacers and 10 amino acid long proteins. Proteins were constructed out of only 11 amino acids, those that does not direct to the N- degradation pathway [1]. Genetic algorithm was used because there is too many combinations of random spacers and 10 aa proteins to computationally test them all. It would take around 2 years and we wouldn't make it for iGEM 2011;) | ||
+ | Genetic algorithm looked like this: | ||
<br> | <br> | ||
- | < | + | <img src="https://static.igem.org/mediawiki/2011/4/40/Genetic.png"></img> |
- | + | ||
<br> | <br> | ||
- | |||
- | |||
- | |||
First we generated set of random expression adapters, then we in silico fused them with several fluorescent proteins, namely GFP, SF-GFP, YFP, mORANGE and RFP - to model their behavior with different proteins. We submited the sequences to a locally installed version of the RBS calculator – an algorithm developed by Christopher A. Voigt [2]. The calculator considers parameters like fold of the protein or complementarity with the ribosomal RNA and returns the infomation of the protein expression strength. | First we generated set of random expression adapters, then we in silico fused them with several fluorescent proteins, namely GFP, SF-GFP, YFP, mORANGE and RFP - to model their behavior with different proteins. We submited the sequences to a locally installed version of the RBS calculator – an algorithm developed by Christopher A. Voigt [2]. The calculator considers parameters like fold of the protein or complementarity with the ribosomal RNA and returns the infomation of the protein expression strength. | ||
Line 45: | Line 47: | ||
</li> | </li> | ||
</ul> | </ul> | ||
- | The best adapters were chosen. Then random mutations and recombination were introduced to sequences and the population was assessed again. | + | The best adapters were chosen. Then random mutations and recombination were introduced to sequences and the population was assessed again. |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
From all generated sequences six adapters providing six different levels of expression and having standard deviation close to 0 (gave the same results for all tested proteins) were chosen and synthesized. The final step was to test them in the wet lab. </div> | From all generated sequences six adapters providing six different levels of expression and having standard deviation close to 0 (gave the same results for all tested proteins) were chosen and synthesized. The final step was to test them in the wet lab. </div> | ||
<br /> | <br /> |
Revision as of 00:08, 21 September 2011
Our Solution
To make truly standardize strength of RBS parts we propose a brand new part in synthetic biology - we call expression adapters. They are short sequences consisting of RBS, 5 bp spacer and a short (10 amino acid long) beginning of a protein. An expression adapter look like this:
Why are they constructed this way:
Why are they constructed this way:
- RBS-spacer-and-the-beginning-of-a-protein determin the fold of the mRNA around the RBS. This way the fold, and subsequently the strength of the RBS is independent of the protein used.
- Spacer is a piece of DNA that is between RBS (e.g. B0034) and ORF (open reading frame). It keeps the optimal distance between those two parts - needed for efficient protein expression
- Promoter is not a part of expression adapter because it is a DNA sequence and is not translated to mRNA
Computational design of the expression adapters
Expression adapters were created by a genetic algorithm that we designed specifically for this task. It generates random 5 bp spacers and 10 amino acid long proteins. Proteins were constructed out of only 11 amino acids, those that does not direct to the N- degradation pathway [1]. Genetic algorithm was used because there is too many combinations of random spacers and 10 aa proteins to computationally test them all. It would take around 2 years and we wouldn't make it for iGEM 2011;)
Genetic algorithm looked like this:
First we generated set of random expression adapters, then we in silico fused them with several fluorescent proteins, namely GFP, SF-GFP, YFP, mORANGE and RFP - to model their behavior with different proteins. We submited the sequences to a locally installed version of the RBS calculator – an algorithm developed by Christopher A. Voigt [2]. The calculator considers parameters like fold of the protein or complementarity with the ribosomal RNA and returns the infomation of the protein expression strength. In genetic algorithm we assessed (out fitness function took into account) two parameters:
First we generated set of random expression adapters, then we in silico fused them with several fluorescent proteins, namely GFP, SF-GFP, YFP, mORANGE and RFP - to model their behavior with different proteins. We submited the sequences to a locally installed version of the RBS calculator – an algorithm developed by Christopher A. Voigt [2]. The calculator considers parameters like fold of the protein or complementarity with the ribosomal RNA and returns the infomation of the protein expression strength. In genetic algorithm we assessed (out fitness function took into account) two parameters:
- the standard deviation of the strength (as computed by RBC calculator)for one expression adapter and various proteins Low standard deviation means that this particular expression adapter strongly determines the fold of the mRNA around an RBS part.
- strength (as computed by RBC calculator) - we evolved sequences to get the highest expression.