DNA Computing for st-Hamiltonian Path

• Encode graph (nodes and edges) into ss-DNA sequences.

• Create all possible paths (overlapping sequences) using DNA hybridization.

• Determine whether the solution

(or the sequence) exists.

Previous slide

Next slide

Back to first slide

View graphic version