DNA computing: Is there a Hamiltonian path through all nodes?

(s) 1

6 (t)

2

5

4

3

An st-Hamiltonian path is (s,3,5,2,4,t).

L. M. Adleman, Science 266, 1021 (1994) Molecular computation of solutions to combinatorial problems.

Previous slide

Next slide

Back to first slide

View graphic version