Adleman's method
-
Make a soup that contains characteristic 20-mers for each
vertex and each edge.
-
A vertex 20-mer has distinct 10-mer codes for ``incoming''
and ``outgoing'' connections.
An edge 20-mer has complements of the outgoing and
incoming codes for the vertices it joins.
Mix the soup well to create oligomers for paths chosen at random.
Select oligomers that meet the following necessary conditions
for Hamilton path.
Use PCR between selections to maintain sample size.
-
- Correct start vertex
Correct finish vertex
Correct length [gel run]
An instance of vertex 1 [denature and hybridize]
An instance of vertex 2
. . .
If anything remains, there is a Hamilton path.
It could be read out by sequencing.
prev next