Team:Rutgers/FA1
From 2011.igem.org
m |
m |
||
(4 intermediate revisions not shown) | |||
Line 29: | Line 29: | ||
<tr> | <tr> | ||
- | <td width="9%" valign="top" class="stuff"><p><img src=" | + | <td width="9%" valign="top" class="stuff"><p><img src="http://gears.rutgers.edu/images/fa/fa_title.png" width="978" height="217"></p> |
<p> </p></td> | <p> </p></td> | ||
</tr> | </tr> | ||
Line 83: | Line 83: | ||
<p class="stuff"> One AND gate that we decided to use was created previously by the Peking 2009 iGEM team. It relies on T7ptag, T7 polymerase with two early amber mutations (stop codons) such that normal translation will result in a truncated non-functional protein, and SupD, a tRNA which allows for translation through amber stop codons (an amber suppressor). So, if just T7ptag or just SupD is expressed, there will not be any functional T7 polymerase, but if both T7ptag and SupD are expressed, then functional T7 polymerase will be created. </p> | <p class="stuff"> One AND gate that we decided to use was created previously by the Peking 2009 iGEM team. It relies on T7ptag, T7 polymerase with two early amber mutations (stop codons) such that normal translation will result in a truncated non-functional protein, and SupD, a tRNA which allows for translation through amber stop codons (an amber suppressor). So, if just T7ptag or just SupD is expressed, there will not be any functional T7 polymerase, but if both T7ptag and SupD are expressed, then functional T7 polymerase will be created. </p> | ||
<p class="stuff">To complete the gate, we place T7ptag on one inducible promoter (our first input), SupD on a different inducible promoter (our second input), and our output on a T7 promoter. This system relies on the fact that basal transcription from the T7 promoter is extremely low, but once functional T7 polymerase is present, transcription is very high. </p> | <p class="stuff">To complete the gate, we place T7ptag on one inducible promoter (our first input), SupD on a different inducible promoter (our second input), and our output on a T7 promoter. This system relies on the fact that basal transcription from the T7 promoter is extremely low, but once functional T7 polymerase is present, transcription is very high. </p> | ||
- | <p class="stuff"><img src=" | + | <p class="stuff"><img src="http://gears.rutgers.edu/images/fa/pekingand.PNG" width="767" height="319"></p> |
<p class="stuff"> </p></td> | <p class="stuff"> </p></td> | ||
<td width="25%" valign="top" background="https://static.igem.org/mediawiki/2011/9/96/Stripe.png" class="stuff" td="td"></td> | <td width="25%" valign="top" background="https://static.igem.org/mediawiki/2011/9/96/Stripe.png" class="stuff" td="td"></td> | ||
Line 101: | Line 101: | ||
<p class="stuff">Split fluorescent proteins function essentially as AND gates. The inputs are activators of whatever promoter we place the split fluorescent proteins under and the output is fluorescence. The primary advantage of this system is its simplicity. It requires just two proteins and two coding sequences. The primary disadvantage of this system is that the output is limited to fluorescence, though engineering of other split proteins can relieve this constraint.</p> | <p class="stuff">Split fluorescent proteins function essentially as AND gates. The inputs are activators of whatever promoter we place the split fluorescent proteins under and the output is fluorescence. The primary advantage of this system is its simplicity. It requires just two proteins and two coding sequences. The primary disadvantage of this system is that the output is limited to fluorescence, though engineering of other split proteins can relieve this constraint.</p> | ||
<p class="stuff"> </p> | <p class="stuff"> </p> | ||
- | < | + | <h4 class="shadow">Construction</h4> |
<p class="stuff">As mentioned previously, a significant amount of the research on these split fluorescent proteins has been done in C. elegans. Unfortunately, many of these C. elegans constructs contain introns, making them unsuitable for expression in E. coli. We therefore decided to recreate split GFP, CFP, and YFP constructs using GFP, CFP, and YFP from the Parts Registry. In order to construct the split proteins, we created BioBricks of the leucine zipper domains with the easily fusable RFC25 prefix and suffix. These standardized parts will facilitate future split protein construction. As demonstrated by our circuit, split proteins have the potential to greatly simplify genetic circuits.</p> | <p class="stuff">As mentioned previously, a significant amount of the research on these split fluorescent proteins has been done in C. elegans. Unfortunately, many of these C. elegans constructs contain introns, making them unsuitable for expression in E. coli. We therefore decided to recreate split GFP, CFP, and YFP constructs using GFP, CFP, and YFP from the Parts Registry. In order to construct the split proteins, we created BioBricks of the leucine zipper domains with the easily fusable RFC25 prefix and suffix. These standardized parts will facilitate future split protein construction. As demonstrated by our circuit, split proteins have the potential to greatly simplify genetic circuits.</p> | ||
- | <p class="stuff"> | + | <p class="stuff"><img src="http://gears.rutgers.edu/images/fa/cznzgfp.gif" width="750" height="618"></p> |
<p class="stuff">To construct split GFP, we first cloned the zipper domains from nzGFP and czGFP with the RFC25 prefix and suffix. Then we mutagenized GFP (BBa_E0040) so that it contained the necessary restriction sites in the correct positions in order to create nzGFP and czGFP. Finally, we digested and ligated the parts. This method is very general and should be easy to apply in searches for other split proteins. </p> | <p class="stuff">To construct split GFP, we first cloned the zipper domains from nzGFP and czGFP with the RFC25 prefix and suffix. Then we mutagenized GFP (BBa_E0040) so that it contained the necessary restriction sites in the correct positions in order to create nzGFP and czGFP. Finally, we digested and ligated the parts. This method is very general and should be easy to apply in searches for other split proteins. </p> | ||
<p class="stuff"> </p></td> | <p class="stuff"> </p></td> | ||
Line 121: | Line 121: | ||
<td colspan="6" class="stuff"><h4 class="shadow"> Introduction </h4> | <td colspan="6" class="stuff"><h4 class="shadow"> Introduction </h4> | ||
+ | <p><img src="http://gears.rutgers.edu/images/fa/bfac.PNG" width="686" height="686"></p> | ||
<p class="stuff"> As described before, we did not create a completely faithful representation of a full adder. When we were first planning the circuit, one major simplifying (and simple) insight we had was that the full adder is just a counting machine. The output only depends on how many inputs are activated; it does not matter which ones are on. With this observation, we could look at the adder as a four state switch, whose state depends on how many inputs are on. This was much easier to work with as demonstrated by the difference in complexity of the two tables below.</p> | <p class="stuff"> As described before, we did not create a completely faithful representation of a full adder. When we were first planning the circuit, one major simplifying (and simple) insight we had was that the full adder is just a counting machine. The output only depends on how many inputs are activated; it does not matter which ones are on. With this observation, we could look at the adder as a four state switch, whose state depends on how many inputs are on. This was much easier to work with as demonstrated by the difference in complexity of the two tables below.</p> | ||
<table> | <table> | ||
<tbody> | <tbody> | ||
<tr> | <tr> | ||
- | <td>Inputs</td> | + | <td bgcolor="#CCCCCC">Inputs</td> |
- | <td>State (Output our circuit gives)</td> | + | <td bgcolor="#CCCCCC">State (Output our circuit gives)</td> |
</tr> | </tr> | ||
<tr> | <tr> | ||
- | <td>0</td> | + | <td bgcolor="#CCCCCC">0</td> |
- | <td>A (No output)</td> | + | <td bgcolor="#CCCCCC">A (No output)</td> |
</tr> | </tr> | ||
<tr> | <tr> | ||
- | <td>1</td> | + | <td bgcolor="#CCCCCC">1</td> |
- | <td>B (RFP)</td> | + | <td bgcolor="#CCCCCC">B (RFP)</td> |
</tr> | </tr> | ||
<tr> | <tr> | ||
- | <td>2</td> | + | <td bgcolor="#CCCCCC">2</td> |
- | <td>C (RFP and GFP)</td> | + | <td bgcolor="#CCCCCC">C (RFP and GFP)</td> |
</tr> | </tr> | ||
<tr> | <tr> | ||
- | <td>3</td> | + | <td bgcolor="#CCCCCC">3</td> |
- | <td>D (RFP, GFP, and CFP)</td> | + | <td bgcolor="#CCCCCC">D (RFP, GFP, and CFP)</td> |
</tr> | </tr> | ||
</tbody> | </tbody> | ||
Line 177: | Line 178: | ||
<h4 class="shadow"> Back to an electrical circuit </h4> | <h4 class="shadow"> Back to an electrical circuit </h4> | ||
- | <br> | + | <p><br> |
- | After designing the circuit, we wondered how different our adder is from an electrical full adder. To answer this question, we needed to know what kind of electrical circuit our genetic circuit corresponds to.< | + | After designing the circuit, we wondered how different our adder is from an electrical full adder. To answer this question, we needed to know what kind of electrical circuit our genetic circuit corresponds to.</p> |
- | < | + | <p><img src="http://upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Full_Adder.svg/500px-Full_Adder.svg.png"> |
- | + | <p><img src="http://gears.rutgers.edu/images/fa/tt.PNG" width="316" height="354"> | |
- | < | + | <p><br> |
- | + | <br> | |
- | + | Full Adder Electrical Circuit<br> | |
- | + | ||
+ | <p><img src="http://gears.rutgers.edu/images/fa/fa3.PNG" width="738" height="388"><br> | ||
+ | Full Adder Genetic Circuit | ||
</p> | </p> | ||
+ | </p> | ||
<p class="stuff">We see that our circuit has one additional output and consists of only 4 AND gates. Although there are many different ways to construct a digital full adder, there are none that use only 4 gates (one of the simplest ones is shown, which uses 5 gates) and none that use only AND gates. Because of the additional output, we say our output is “encoded.” </p> | <p class="stuff">We see that our circuit has one additional output and consists of only 4 AND gates. Although there are many different ways to construct a digital full adder, there are none that use only 4 gates (one of the simplest ones is shown, which uses 5 gates) and none that use only AND gates. Because of the additional output, we say our output is “encoded.” </p> | ||
<p class="stuff"> </p> | <p class="stuff"> </p> | ||
Line 214: | Line 218: | ||
<td colspan="6" class="stuff"><h4 class="shadow"> Overview</h4> | <td colspan="6" class="stuff"><h4 class="shadow"> Overview</h4> | ||
<p class="stuff"> Unfortunately, we were unable to finish constructing our circuit in time for the wiki freeze. The following parts have been submitted to the Registry of Standard Biological Parts.</p> | <p class="stuff"> Unfortunately, we were unable to finish constructing our circuit in time for the wiki freeze. The following parts have been submitted to the Registry of Standard Biological Parts.</p> | ||
- | < | + | </html><groupparts>iGEM011 Rutgers</groupparts><html> |
<p class="stuff"> </p></td> | <p class="stuff"> </p></td> | ||
<td width="25%" align="center" valign="baseline" background="https://static.igem.org/mediawiki/2011/9/96/Stripe.png" td><p> </p></td> | <td width="25%" align="center" valign="baseline" background="https://static.igem.org/mediawiki/2011/9/96/Stripe.png" td><p> </p></td> |
Latest revision as of 04:37, 29 September 2011
RUTGERS iGEM TEAM WIKI |
||||||||||||||||||||||||
|
||||||||||||||||||||||||
| ||||||||||||||||||||||||
| ||||||||||||||||||||||||
| ||||||||||||||||||||||||
| ||||||||||||||||||||||||
| ||||||||||||||||||||||||
| ||||||||||||||||||||||||