Davidson Missouri W

From 2007.igem.org

(Difference between revisions)
(The Team)
m (Our Project)
Line 116: Line 116:
<br>  
<br>  
-
 
+
[[Image:AdlemanKendy.png|thumb|300px|center|The Adleman graph.]] 
[[Image:Adelman.png|thumb|300px|center|The Adleman graph.]]   
[[Image:Adelman.png|thumb|300px|center|The Adleman graph.]]   
-
<center> For the graph used in Adelman's paper (shown above), the Hamiltonian Path Problem would ask: can you find a path along the directed edges that travels from node 1 (green) to node 5 (red) and visits each node on the graph exactly once? <br>
+
<center> For the graph used in Adleman's paper (shown above), the Hamiltonian Path Problem would ask: can you find a path along the directed edges that travels from node 1 (green) to node 5 (red) and visits each node on the graph exactly once? <br>
[http://2007.igem.org/wiki/images/6/6f/Adelmansolution.png Click here] for the solution.
[http://2007.igem.org/wiki/images/6/6f/Adelmansolution.png Click here] for the solution.
</center>
</center>

Revision as of 19:44, 24 October 2007

Home | Background Information | Current Project: Solving the Hamiltonian Path Problem in vivo | Mathematical Modeling | Gene Splitting | Results | Traveling Salesperson Problem | Software | Resources and Citations


Dmw logo2.png
Computer.png

The Team

The Team The Faculty Team Logos Group Photo
Davidson

Oyinade Adefuye
Will DeLoache
Jim Dickson
Andrew Martens
Amber Shoecraft
Mike Waters

A. Malcom Campbell
Karmella Haynes
Laurie Heyer

DavidsonLogo.gif

Team1.jpg
Missouri Western

Jordan Baumgardner
Tom Crowley
Lane H. Heard
Nickolaus Morton
Michelle Ritter
Jessica Treece
Matthew Unzicker
Amanda Valencia

Todd Eckdahl
Jeff Poet

MWLogo.gif
MWSUteam.jpeg

Our Project

In Depth Overview

Background Information


Current Project: Solving the Hamiltonian Path Problem in vivo


Mathematical Modeling


Gene Splitting


Results


Traveling Salesperson Problem


Software


Resources and Citations


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 (see citations) 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.


File:AdlemanKendy.png

The Adleman graph.
For the graph used in Adleman's paper (shown above), the Hamiltonian Path Problem would ask: can you find a path along the directed edges that travels from node 1 (green) to node 5 (red) and visits each node on the graph exactly once?

Click here for the solution.


A Human Representation of the Adelman Graph.





<Previous Section | Next Section>