Davidson Missouri W

From 2007.igem.org

(Difference between revisions)
(→The Team)
(→Our Successful Project)
 
(35 intermediate revisions not shown)
Line 3: Line 3:
<hr>
<hr>
<br>
<br>
 +
[[Image:dmw_logo2.png|center]]
-
[[Image:DMW-1.jpg|300px|center]]
+
[[Image:Computer.png|center]]
<center>
<center>
Line 13: Line 14:
! style="color: white; background-color: black;"| The Team
! style="color: white; background-color: black;"| The Team
! style="color: white; background-color: black;" | The Faculty
! style="color: white; background-color: black;" | The Faculty
-
! style="color: white; background-color: black;" | Team Logos
+
! style="color: white; background-color: black;" | School Logos
! style="color: white; background-color: black;" | Group Photo
! style="color: white; background-color: black;" | Group Photo
|-
|-
Line 34: Line 35:
|style="color: black; background-color: red;" align="center"|
|style="color: black; background-color: red;" align="center"|
<b>
<b>
-
[[Davidson Missouri W/A. Malcolm Campbell|<span style="color:black">A. Malcom Campbell</span>]]
+
[[Davidson Missouri W/A. Malcolm Campbell|<span style="color:black">A. Malcolm Campbell</span>]]
<br>
<br>
[[Davidson Missouri W/Karmella Haynes|<span style="color:black">Karmella Haynes</span>]]
[[Davidson Missouri W/Karmella Haynes|<span style="color:black">Karmella Haynes</span>]]
Line 45: Line 46:
|style="color: black; background-color: white;" align="center"|
|style="color: black; background-color: white;" align="center"|
-
[[Image:Team1.jpg|thumb|300px]]
+
[[Image:Team1.jpg|thumb|center|300px]]
|-
|-
Line 77: Line 78:
|style="color: black; background-color: white;" align="center"|[[Image:MWLogo.gif]]
|style="color: black; background-color: white;" align="center"|[[Image:MWLogo.gif]]
-
|style="color: black; background-color: white;" align="center"|
+
|style="color: black; background-color: white;" align="center"|[[Image:MWSUteam.jpeg|thumb|center|300px]]
|-
|-
|}
|}
-
 
<br>
<br>
-
 
-
<html>
 
-
<head>
 
-
<link rel="stylesheet" href="http://www2.davidson.edu/studentlife/stu_orgs/frisbee/rollover_team.css"&action=raw&ctype=text/css" type="text/css" />
 
-
</style>
 
-
</head>
 
-
<body>
 
-
 
-
<div class="rollover">
 
<center>
<center>
-
<a href="#"></a>
 
-
</center>
 
-
</div>
 
-
</body>
 
-
</html>
 
-
<center> '''A Human Representation of the Adelman Graph.'''
+
=Our Successful Project=
-
<br>
+
-
<br>
+
-
 
+
-
=Our Project=
+
</center>
</center>
Line 129: Line 111:
<br><br><Br>
<br><br><Br>
|Hamiltonian Path Problem
|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.
+
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 [[Davidson_Missouri_W/Resources_and_Citations | 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''.
+
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 [[Davidson_Missouri_W/Resources_and_Citations | 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''. ([[Davidson Missouri W/Background Information#Why Use Bacteria?|Why use a bacterial computer?]])
<br>  
<br>  
 +
 
 +
[[Image:Adelman.png|thumb|300px|center|The Adleman graph.]] 
 +
 +
<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>
 +
[https://static.igem.org/mediawiki/2007/6/6f/Adelmansolution.png Click here] for the solution.
 +
</center>
 +
|}
-
[[Image:AdelmanGraph.JPG|thumb|300px|center|The Adleman graph.]] 
 
<br>
<br>
-
[[Image:HamiltonianGraph.PNG|thumb|700px|center|A graph implemented on a plasmid.]]
+
<center> '''A Human Representation of the Adleman Graph. (mouse over to see the full effect)'''
-
|}
+
<html>
 +
<head>
 +
<link rel="stylesheet" href="https://2007.igem.org/wiki/index.php?title=User:Wideloache/igem2007.css&action=raw&ctype=text/css" type="text/css" />
 +
</style>
 +
</head>
 +
<body>
 +
 
 +
<div class="rollover">
 +
<center>
 +
<a href="#"></a>
 +
</center>
 +
</div>
 +
</body>
 +
</html>
 +
 
 +
<br>
 +
<br>
 +
 
 +
<br>
 +
<hr>
 +
 
 +
<Previous Section | [[Davidson Missouri W/Background Information | Next Section>]]
 +
</center>

Latest revision as of 04:32, 27 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 School Logos Group Photo
Davidson

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

A. Malcolm 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 Successful 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 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?)


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 Adleman Graph. (mouse over to see the full effect)




<Previous Section | Next Section>

Retrieved from "http://2007.igem.org/wiki/index.php/Davidson_Missouri_W"