Difference between revisions of "Davidson Missouri W"
(→The Team) |
(→The Team: gold background color instead of yellow) |
||
| Line 44: | Line 44: | ||
|- | |- | ||
| − | |style="color: black; background-color: | + | |style="color: black; background-color: gold;" align="center"|'''Missouri Western''' |
<b> | <b> | ||
[[Jordan Baumgardner|<span style="color:black;">Jordan Baumgardner</span>]] | [[Jordan Baumgardner|<span style="color:black;">Jordan Baumgardner</span>]] | ||
| Line 63: | Line 63: | ||
</b> | </b> | ||
| − | |style="color: yellow; background-color: | + | |style="color: yellow; background-color: gold;" align="center"| |
<b> | <b> | ||
[[Todd Eckdahl|<span style="color:black;">Todd Eckdahl</span>]] | [[Todd Eckdahl|<span style="color:black;">Todd Eckdahl</span>]] | ||
Revision as of 21:08, 7 July 2007
The Team
| The Team | The Faculty | Team Logos | Group Photo |
|---|---|---|---|
| Davidson
Oyinade Adefuye
|
|
||
| Missouri Western
Jordan Baumgardner
|
|
| A Human Representation of Adleman's Graph |
The Problem
| 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 continue 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 Adelman in 1994 (citation below) where a unique Hamiltonian path was found in vitro for a particular directed graph on seven nodes. We propose to make progress toward solving the particular problem in vivo.
| ||
