Davidson Missouri W/Controlling Expression
From 2007.igem.org
Wideloache (Talk | contribs) |
Wideloache (Talk | contribs) |
||
| Line 1: | Line 1: | ||
<center>[[Davidson Missouri W| <span style="color:red">Home</span>]] | [[Davidson Missouri W/Background Information| <span style="color:red">Background Information</span>]] | [[Davidson Missouri W/Solving the HPP in vivo| <span style="color:red">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] | [[Davidson Missouri W/Mathematical Modeling| <span style="color:red">Mathematical Modeling</span>]] | [[Davidson Missouri W/Gene splitting| <span style="color:red"> Gene Splitting </span>]] | [[Davidson Missouri W/Controlling Expression| <span style="color:black"> Controlling Expression </span>]] | [[Davidson Missouri W/Traveling Salesperson Problem| <span style="color:red">Traveling Salesperson Problem</span> ]] | [[Davidson Missouri W/Software|<span style="color:red">Software</span>]] | [[Davidson Missouri W/Resources and Citations|<span style="color:red">Resources and Citations</span>]]</center> | <center>[[Davidson Missouri W| <span style="color:red">Home</span>]] | [[Davidson Missouri W/Background Information| <span style="color:red">Background Information</span>]] | [[Davidson Missouri W/Solving the HPP in vivo| <span style="color:red">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]] | [[Davidson Missouri W/Mathematical Modeling| <span style="color:red">Mathematical Modeling</span>]] | [[Davidson Missouri W/Gene splitting| <span style="color:red"> Gene Splitting </span>]] | [[Davidson Missouri W/Controlling Expression| <span style="color:black"> Controlling Expression </span>]] | [[Davidson Missouri W/Traveling Salesperson Problem| <span style="color:red">Traveling Salesperson Problem</span> ]] | [[Davidson Missouri W/Software|<span style="color:red">Software</span>]] | [[Davidson Missouri W/Resources and Citations|<span style="color:red">Resources and Citations</span>]]</center> | ||
| + | <hr> | ||
| + | <br> | ||
To solve the Hamiltonian Path Problem our team needs to utilize a mechanism that is capable to transcribing a sequence of adjacent genes downstream of a single promoter region. Due to the "flippable" nature of our construct, inserting a second promoter region downstream of our initial promoter region is not feasible, as we would be unable to insure that a "solved" phenotype was the result of a single path through the graph. Because of our inability to control gene expression downstream of the start of transcription, we searched for promoters of the highest processivity and repressibility. Thanks to the biobrick system we could choose from any operon in the E.Coli genome. | To solve the Hamiltonian Path Problem our team needs to utilize a mechanism that is capable to transcribing a sequence of adjacent genes downstream of a single promoter region. Due to the "flippable" nature of our construct, inserting a second promoter region downstream of our initial promoter region is not feasible, as we would be unable to insure that a "solved" phenotype was the result of a single path through the graph. Because of our inability to control gene expression downstream of the start of transcription, we searched for promoters of the highest processivity and repressibility. Thanks to the biobrick system we could choose from any operon in the E.Coli genome. | ||
Latest revision as of 14:58, 27 September 2007
To solve the Hamiltonian Path Problem our team needs to utilize a mechanism that is capable to transcribing a sequence of adjacent genes downstream of a single promoter region. Due to the "flippable" nature of our construct, inserting a second promoter region downstream of our initial promoter region is not feasible, as we would be unable to insure that a "solved" phenotype was the result of a single path through the graph. Because of our inability to control gene expression downstream of the start of transcription, we searched for promoters of the highest processivity and repressibility. Thanks to the biobrick system we could choose from any operon in the E.Coli genome.
The Promoter Tester
We will also produce two constructs for tetsing promoters. MWSU will produce (Kan, RFP, Tet) while Davidson will produce (Kan, Tet, RFP). We can drop in different promoters and look for phenotypes.
pLac
The promoter of the Lac operon was an optimal place to start becuase the kinetics of control are well documented in comparison to most E.Coli operons.
In addition to pLac we are going to test a lambda model promoter, the ompC porin biobrick promoter, and the T7 RNA Polymerase promoter.
Davidson is also going to have synthesized an improved pLac promoter that is shorter, will have better repression, better induction, and hopefully lack the backwards promotion we have detected with Part: [http://partsregistry.org/Part:BBa_R0010 BBa_R0010]. We will test out the modified promoter [http://partsregistry.org/Part:BBa_R0011 BBa_R0011] which is reported to have good repression and strong induction. We may still introduce the UV5 double mutation to enhance transcription and compare with R0010.
Davidson will also test 8 different promoters from the registry to see if any of them can promote transcription of all three genes in the promoter tester.
MWSU is also going to produce backwards LacIq to put upstream of pLac [http://partsregistry.org/Part:BBa_R0010 BBa_R0010]. The purpose of this is to have more LacIq in the cytoplasm at all times, regardless of ITPG status.
