# Davidson Missouri W/Solving the HPP in vivo

(Difference between revisions)
 Revision as of 20:49, 26 September 2007 (view source)Miwaters (Talk | contribs)← Older edit Revision as of 20:54, 26 September 2007 (view source)Miwaters (Talk | contribs) Newer edit → Line 1: Line 1: -
[[Davidson Missouri W| Home]] | [[Davidson Missouri W/Background Information| Background Information]] | [[Davidson Missouri W/Solving the HPP in vivo| Current Project: Solving the Hamiltonian Path Problem ''in vivo'']] | [[Davidson Missouri W/Mathematical Modeling| Mathematical Modeling]] | [[Davidson Missouri W/Gene splitting| Gene Splitting ]] | [[Davidson Missouri W/Controlling Expression| Controlling Expression ]] | [[Davidson Missouri W/Resources and Citations|Resources and Citations]]
+
[[Davidson Missouri W| Home]] | [[Davidson Missouri W/Background Information| Background Information]] | [[Davidson Missouri W/Solving the HPP in vivo| Current Project: Solving the Hamiltonian Path Problem ''in vivo'']] | [[Davidson Missouri W/Mathematical Modeling| Mathematical Modeling]] | [[Davidson Missouri W/Gene splitting| Gene Splitting ]] | [[Davidson Missouri W/Controlling Expression| Controlling Expression ]] | [[Davidson Missouri W/Traveling Salesperson Problem| Traveling Salesperson Problem ]] | [[Davidson Missouri W/Software|Software]] | [[Davidson Missouri W/Resources and Citations|Resources and Citations]]
- +

## Revision as of 20:54, 26 September 2007

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

Using the Hin/HixC flipping mechanism, we are developing a bacterial computer which solves a specific mathematical problem, the Hamiltonian Path problem.

# The Hamiltonian Path Problem

A Hamiltonian Path is a trip through a graph which visits each node exactly once. A graph may have multiple Hamiltonian Paths, only one, or even none. Given a graph, a starting point and an endpoint, does it contain a Hamiltonian path?

We solve our problem by transforming E. coli cells with specially engineered plasmids.

## Designing a Plasmid

Our plasmid consists of reporter genes and HixC sites. HixC sites are placed within the coding regions of our reporter genes. The reporter genes are joined in such a way as to represent a graph. Each reporter gene represents a node, and the connection of two reporter genes together without any HixC sites in between represents an edge.

Above: A graph on a plasmid. Below: flipping into a solution.

## Developing Nodes

We represent the graph's nodes with reporter genes. In order to allow for flipping, we must insert HixC sites within the coding regions of our reporter genes. We call this process gene splitting. If our reporter gene tolerates a HixC insertion then we can use it as a node on our graph.