"
Team:MoWestern Davidson/FSLs
From 2009.igem.org
(→FSL Design:) |
(→FSL Design:) |
||
| Line 3: | Line 3: | ||
=FSL Design:= | =FSL Design:= | ||
| + | Table: | ||
| + | <span style="color:#ff0000">LC1 : VVVVVgVVVVV </span><br /> | ||
| + | <span style="color:#008000">LC2 : XXXXXgXXXXX </span><br /> | ||
| + | <span style="color:#0000ff">LC3 : YYYYYgYYYYY </span><br /> | ||
| + | <span style="color:#800080">LC4 : ZZZZZgZZZZZ </span><br /> | ||
| + | |||
To encode the SAT problem into the reporter gene we needed to mutate the reporter genes that we wanted. To do so we employed PCR mutatgenesis. By using a forward primer that contains the biobrick prefix, ATG, our desired mutation, and then the 15nt after the first codon of the gene we were able to insert the mutations. We have several different constructs for determining how many clauses are satisfied. The first construct was to test the suppression ability of our tRNAs. For this we simply inserted a 5nt sequence that matches one of our tRNAs. | To encode the SAT problem into the reporter gene we needed to mutate the reporter genes that we wanted. To do so we employed PCR mutatgenesis. By using a forward primer that contains the biobrick prefix, ATG, our desired mutation, and then the 15nt after the first codon of the gene we were able to insert the mutations. We have several different constructs for determining how many clauses are satisfied. The first construct was to test the suppression ability of our tRNAs. For this we simply inserted a 5nt sequence that matches one of our tRNAs. | ||
Revision as of 19:21, 28 July 2009
FSL Design:
Table:
LC1 : VVVVVgVVVVV
LC2 : XXXXXgXXXXX
LC3 : YYYYYgYYYYY
LC4 : ZZZZZgZZZZZ
To encode the SAT problem into the reporter gene we needed to mutate the reporter genes that we wanted. To do so we employed PCR mutatgenesis. By using a forward primer that contains the biobrick prefix, ATG, our desired mutation, and then the 15nt after the first codon of the gene we were able to insert the mutations. We have several different constructs for determining how many clauses are satisfied. The first construct was to test the suppression ability of our tRNAs. For this we simply inserted a 5nt sequence that matches one of our tRNAs.
atg CCCUC gct …
The second construct is one 2-SAT logical clause. In this case if one of the suppressor tRNAs that is encoded in the logical clause is present in the cell, then the frameshift will be suppressed and the reporter will be expressed.
aug VVVVV g VVVVVV gct ...
In the above example CCCUC g CCACC represents the logical clause (A or B). If neither 5base insertion is suppressed, then the translation will be off track when it gets to the gct (the 2nd codon in unmutated RFP). If either tRNA is present and suppresses its insertion, then the frame will be restored when the translation gets to gct.
