Davidson Missouri W/Solving the HPP in vivo

Using the same flipping mechanism, we are trying to develop a bacterial computer which solves a new type of 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, is there a Hamiltonian path?

How We Solve It

Designing a Plasmid