Difference between revisions of "Term paper wiki"
Line 3: | Line 3: | ||
− | = | + | =Stochasticity in Gene Expression= |
Line 42: | Line 42: | ||
|} | |} | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<Previous Section | [[Davidson Missouri W/Background Information | Next Section>]] | <Previous Section | [[Davidson Missouri W/Background Information | Next Section>]] | ||
</center> | </center> |
Revision as of 19:21, 11 November 2007
Stochasticity in Gene Expression
In Depth | Overview | ||
---|---|---|---|
Background Information
|
Hamiltonian Path Problem
As a part of iGEM2006, a combined team from Davidson College and Missouri Western State University reconstituted a hin/hix DNA recombination mechanism which exists in nature in Salmonella as standard biobricks for use in E. coli. The purpose of the 2006 combined team was to provide a proof of concept for a bacterial computer in using this mechanism to solve a variation of The Pancake Problem from Computer Science. This task utilized both biology and mathematics students and faculty from the two institutions. For 2007, we successfully continued our collaboration and our efforts to manipulate E. coli into mathematics problem solvers as we refine our efforts with the hin/hix mechanism to explore another mathematics problem, the Hamiltonian Path Problem. This problem was the subject of a groundbreaking paper by Adleman in 1994 (see citations) where a unique Hamiltonian path was found in vitro for a particular directed graph on seven nodes. We were able to use bacterial computers to solve the Hamiltonian path problem in vivo. (Why use a bacterial computer?)
File:Adelman.png The Adleman graph. Click here for the solution. |
<Previous Section | Next Section>
</center>