From 2007.igem.org

We have been developing different number of edges/node graphs that can be used to build as practice to eventually make our 12 edge/7 node graph. For each graph the promoter is 1 and the terminator for each graph is stated before each graph is shown. We have generated a table also that will include all the graphs that we have and will develop along with characteristics about each graph. The characteristic include number of Hamiltonian Paths, number of true positives, number of false positives, number of total arrangements, easiest number of flips, medium number of flips and hard number of flips.

The following graph is a subgraph of Adelman's graph with 9 edges/6.

Hamiltonian Path (HP) - 1 12 42 23 36 65

The following graph is another subgraph of Adedlmans graph with 7 edges/5 nodes but with terminator at 7 instead of 5.

HP-1 12 23 34 47

The following graph is a combination of a 3 node graph that Missouri Western is going to build and what Davidson is going to build with the terminator at 3.

HP - 1 12 23

For the rest of the graphs shown on this site the terminator will be 3.

The graph below is a 4 edge/4 edge graph.

HP- 1 12 24 43

The graph below is a 5 edge/4 node graph.

HP-1 12 24 43

This graph shown below is a 4 edge/ 4 node graph.

HP- 1 14 42 23

The graph shown below is a 5 edge / 4 node graph.

HP- 1 14 42 23

This final graph shown below is a 6 edge / 4 node grarph.

It has multiple Hamiltonian Paths ( it can be used to help solve the traveling salesperson problem).