Davidson Missouri W

From 2007.igem.org

(Difference between revisions)
m (Western Meeting Notes)
(Our Successful Project)
 
(211 intermediate revisions not shown)
Line 1: Line 1:
-
===Davidson & Missouri Western Team Logos, iGEM2006=== <br>
+
<center>[[Davidson Missouri W| <span style="color:black">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/Results| <span style="color:red">Results</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>
-
[[Image:EHOP.gif|thumb|300px|center| ]]
+
 
-
<br>
+
<hr>
-
[[Image:Ihop.PNG|thumb|300px|center| ]]
+
<br>
<br>
 +
[[Image:dmw_logo2.png|center]]
-
----
+
[[Image:Computer.png|center]]
-
===Western Meeting Notes===
+
-
'''5/14  Overview of goals for the next two weeks'''
+
<center>
 +
=The Team=
 +
</center>
 +
{| border="1" cellpadding="5" cellspacing="0" align="center" width="100%"
 +
|-
 +
! style="color: white; background-color: black;"| The Team
 +
! style="color: white; background-color: black;" | The Faculty
 +
! style="color: white; background-color: black;" | School Logos
 +
! style="color: white; background-color: black;" | Group Photo
 +
|-
-
Begin Experimentation
+
|style="color: black; background-color: red;" align="center"| '''Davidson'''
 +
<b>
 +
[[Davidson Missouri W/Oyinade Adefuye|<span style="color:black">Oyinade Adefuye</span>]]
 +
<br>
 +
[[Davidson Missouri W/Will DeLoache|<span style="color:black">Will DeLoache</span>]]
 +
<br>
 +
[[Davidson Missouri W/Jim Dickson|<span style="color:black">Jim Dickson</span>]]
 +
<br>
 +
[[Davidson Missouri W/Andrew Martens|<span style="color:black">Andrew Martens</span>]]
 +
<br>
 +
[[Davidson Missouri W/Amber Shoecraft|<span style="color:black">Amber Shoecraft</span>]]
 +
<br>
 +
[[Davidson Missouri W/Mike Waters|<span style="color:black">Mike Waters</span>]]
 +
</b>
-
Educational Information
+
|style="color: black; background-color: red;" align="center"|
 +
<b>
 +
[[Davidson Missouri W/A. Malcolm Campbell|<span style="color:black">A. Malcolm Campbell</span>]]
 +
<br>
 +
[[Davidson Missouri W/Karmella Haynes|<span style="color:black">Karmella Haynes</span>]]
 +
<br>
 +
[[Davidson Missouri W/Laurie Heyer|<span style="color:black">Laurie Heyer</span>]]
 +
</b>
-
Literature Research
+
|style="color: black; background-color: white;" align="center"|
 +
[[Image:DavidsonLogo.gif]]
 +
|style="color: black; background-color: white;" align="center"|
 +
[[Image:Team1.jpg|thumb|center|300px]]
-
'''5/15''' 
+
|-
-
Reviewed PowerPoint presentations of 2006 project to gain an understanding of the Pancake Problem.
+
|style="color: black; background-color: gold;" align="center"|'''Missouri Western'''
 +
<b>
 +
[[Davidson Missouri W/Jordan Baumgardner|<span style="color:black;">Jordan Baumgardner</span>]]
 +
<br>
 +
[[Davidson Missouri W/Tom Crowley|<span style="color:black;">Tom Crowley</span>]]
 +
<br>
 +
[[Davidson Missouri W/Lane H. Heard|<span style="color:black;">Lane H. Heard</span>]]
 +
<br>
 +
[[Davidson Missouri W/Nickolaus Morton|<span style="color:black;">Nickolaus Morton</span>]]
 +
<br>
 +
[[Davidson Missouri W/Michelle Ritter|<span style="color:black;">Michelle Ritter</span>]]
 +
<br>
 +
[[Davidson Missouri W/Jessica Treece|<span style="color:black;">Jessica Treece</span>]]
 +
<br>
 +
[[Davidson Missouri W/Matthew Unzicker|<span style="color:black;">Matthew Unzicker</span>]]
 +
<br>
 +
[[Davidson Missouri W/Amanda Valencia|<span style="color:black;">Amanda Valencia</span>]]
 +
</b>
-
Viewed Bruce's presentation on the mutation of the hix sites
+
|style="color: black; background-color: gold;" align="center"|
 +
<b>
 +
[[Davidson Missouri W/Todd Eckdahl|<span style="color:black;">Todd Eckdahl</span>]]
 +
<br>
 +
[[Davidson Missouri W/Jeff Poet|<span style="color:black;">Jeff Poet</span>]]
 +
</b>
-
Developed plan to build testing constructs of mutant hix sites, arriving this afternoon from Davidson by FedEx
+
|style="color: black; background-color: white;" align="center"|[[Image:MWLogo.gif]]
-
Will build pLac - hix(n) - BBa_S03644 (RFPrev-RBSrev) - hix(n) on AmpR plasmid.  Details to follow.
+
|style="color: black; background-color: white;" align="center"|[[Image:MWSUteam.jpeg|thumb|center|300px]]
 +
|-
-
'''Note -- The above plan has changed as of Tuesday afternoon because of availability of parts.'''
+
|}
 +
<br>
 +
<center>
-
BBa_S03644 is not available in our lab and the exact forward equivalent appears (amazingly) to not exist anywhere.  However, there is an RBS - RFP in the Registry (BBa_I13502) which is a preassembled combination of a weaker RBS (BBa_B0034) and RFP (BBa_E1010).  There is also a full positive control assembly (BBa_J04450) of pLac - B0034 - E1010 - Term.  We will need to be careful to use the same parts in our Hix(n) assemblies so that we can test for only the functionality of our construct with the mutated Hix sites included.
+
=Our Successful Project=
 +
</center>
-
'''5/16'''
+
{| border="1" cellpadding="5" cellspacing="0" align="center" width="90%"
 +
|-
 +
! style="color: black; background-color: red;" width="20%"| <font size="+1">In Depth</font>
 +
! colspan="3" style="color: black; background-color: red;" width="60%"| <font size="+1">Overview</font>
 +
|-
 +
|style="color: black; background-color: black;" align="center"|
 +
[[Davidson Missouri W/Background Information|<span style="color:red">Background Information</span>]]
 +
<br><br><br>
 +
[[Davidson Missouri W/Solving the HPP in vivo|<span style="color:red">Current Project: Solving the Hamiltonian Path Problem ''in vivo''</span>]]
 +
<br><br><br>
 +
[[Davidson Missouri W/Mathematical Modeling|<span style="color:red">Mathematical Modeling</span>]]
 +
<br><br><br>
 +
[[Davidson Missouri W/Gene splitting|<span style="color:red">Gene Splitting</span>]]
 +
<br><br><br>
 +
[[Davidson Missouri W/Results|<span style="color:red">Results</span>]]
 +
<br><br><br>
 +
[[Davidson Missouri W/Traveling Salesperson Problem|<span style="color:red">Traveling Salesperson Problem</span>]]
 +
<br><br><br>
 +
[[Davidson Missouri W/Software|<span style="color:red">Software</span>]]
 +
<br><br><br>
 +
[[Davidson Missouri W/Resources and Citations|<span style="color:red">Resources and Citations</span>]]
 +
<br><br><Br>
 +
|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.
-
We have cultures that were grown overnight of the Hix(n). We received the sequencing data on the Karen's and Bruce's Hix(n) constructs (from 5/14 report) and are analyzing the data to find the mutations.  Lab work continues.
+
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?]])
-
[[Image:hixn.jpg|thumb|500px|center| ]]
+
<br>
 +
 
 +
[[Image:Adelman.png|thumb|300px|center|The Adleman graph.]]  
-
''5/17''
+
<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>
 +
|}
-
Karen developed a modified Green Fuorescent protein, GFP, by splitting the DNA for GFP, reversing one portion and adding Hix sites to it. This way, GFP can only be produced when the reversed portion is inverted so that the entire gene is in the correct order. This method was attempted with the TET resistance gene with no results. We have looked at using several fluorescent proteins modified in this manner to study the Traveling Salesman. In this manner, the proteins would only be expressed if they had all been lined up in the correct order. This approach has some flaws however, all fluorescent proteins are similar in structure, so that even if the portions of two different genes come together, the resulting protein may still fluoresce. Additionally, fluorescent protiens have the ability to undergo fluorescent resonant energy transfer, FRET, a phenomenon in which energy absorbed by one molecule is directly transfered to a second molecule, this prevents the first molecule from emitting visible photons, so that it may remain undetected.
+
<br>
 +
<center> '''A Human Representation of the Adleman Graph. (mouse over to see the full effect)'''
-
== '''Students''' ==
+
<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>
-
[[Image:Header_01.gif]]
+
<div class="rollover">
 +
<center>
 +
<a href="#"></a>
 +
</center>
 +
</div>
 +
</body>
 +
</html>
 +
<br>
 +
<br>
-
• Jordan Baumgardner, junior biology, biochem/molecular bio major,  [mailto:jbaumgardner@missouriwestern.edu]
+
<br>
-
 
+
<hr>
-
• Ryan Chilcoat, junior biology major (health sciences),  [mailto:rchilcoat@missouriwestern.edu]
+
-
 
+
-
• Tom Crowley, senior biochem/molecular biology major,  [mailto:stc8033@missouriwestern.edu]
+
-
 
+
-
• Lane H. Heard, Central High School graduate,  [mailto:axenmoon@hotmail.com]
+
-
 
+
-
• Nickolaus Morton, junior chemistry major,  [mailto:nmorton@missouriwestern.edu]
+
-
 
+
-
• Michelle Ritter, junior mathematics major,  [mailto:mrr5418@missouriwestern.edu]
+
-
 
+
-
• Miranda Showalter, junior biology major (health sciences),  [mailto:mpp4950@missouriwestern.edu]
+
-
 
+
-
• Jessica Treece, junior biology major (health sciences),  [mailto:jtreece@missouriwestern.edu]
+
-
 
+
-
• Matthew Unzicker, senior biochem/molecular biology major,  [mailto:mru8487@missouriwestern.edu]
+
-
 
+
-
• Amanda Valencia, senior biochem/molecular biology major,  [mailto:avalencia@missouriwestern.edu]
+
-
-----
+
-
[[Image:Logo.gif]]
+
-
 
+
-
• Will DeLoache, ??? major,  [mailto:???@davidson.edu]
+
-
 
+
-
• Oyinade Adefuye, ??? major,  [mailto:???@davidson.edu]
+
-
 
+
-
• Jim Dickson , ??? major,  [mailto:???@davidson.edu]
+
-
 
+
-
• Amber Shoecraft, ??? major,  [mailto:???@davidson.edu]
+
-
 
+
-
• Andrew Martens, ??? major,  [mailto:???@davidson.edu]
+
-
 
+
-
• Michael Waters, ??? major,  [mailto:???@davidson.edu]
+
-
 
+
-
== '''Faculty''' ==
+
-
[[Image:Header_01.gif]]
+
-
 
+
-
• Todd Eckdahl [http://staff.missouriwestern.edu/~eckdahl/], Professor, Department of Biology, [mailto:eckdahl@missouriwestern.edu]
+
-
 
+
-
• Jeff Poet [http://staff.missouriwestern.edu/~poet/], Assistant Professor, Department of Computer Science, Mathematics, and Physics, [mailto:poet@missouriwestern.edu]
+
-
 
+
-
Shipping Address: Todd Eckdahl, Biology Department, Missouri Western State University, 4525 Downs Drive, Saint Joseph, MO, 64507 [(816) 271-5873]
+
-
 
+
-
----
+
-
[[Image:Logo.gif]]
+
-
 
+
-
• Malcolm Campbell [http://www.bio.davidson.edu/people/macampbell/macampbell.html], Professor, Department of Biology, [mailto:macampbell@davidson.edu]
+
-
 
+
-
• Karmella Haynes [http://www.bio.davidson.edu/people/kahaynes/kahaynes.html], Visiting Assistant Professor, Department of Biology, [mailto:kahaynes@davidson.edu]
+
-
 
+
-
• Laurie Heyer [http://www.davidson.edu/math/heyer/], Associate Professor, Department of Mathematics, [mailto:laheyer@davidson.edu]
+
-
 
+
-
Shipping Address: Malcolm Campbell, Biology Dept. Davidson College, 209 Ridge Road, Davidson, NC 28036 [(704) 894-2692]
+
-
 
+
-
== '''Project Overview'''==
+
-
 
+
-
<font color="blue">Solving the Pancake Problem with an E. coli Computer </font color>  
+
-
Our goal is to genetically engineer a biological system that can compute solutions to a puzzle called the burnt pancake problem. The EHOP computer is a proof of concept for computing in vivo, with implications for future data storage devices and transgenic systems.
+
-
 
+
-
== '''Resources / Citations'''==
+
-
 
+
-
Cool site for Breakfast
+
-
[http://www.cut-the-knot.org/SimpleGames/Flipper.shtml]
+
-
 
+
-
Karen Acker's paper describing GFP and TetA(c) with Hix insertions
+
-
[http://www.bio.davidson.edu/Courses/Immunology/Students/spring2006/Acker/Acker_finalpaperGFP.doc]
+
-
 
+
-
Bruce Henschen's paper describing one-time flippable Hix sites
+
-
[http://www.bio.davidson.edu/Courses/genomics/2006/henschen/Bruce_Finalpaper.doc]
+
-
Intro to Hamiltonian Path Problem and DNA
+
<Previous Section | [[Davidson Missouri W/Background Information | Next Section>]]
-
[http://www.ams.org/featurecolumn/archive/dna-abc2.html]
+
</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>