DNA computing the Hamiltonian path problem.
The directed Hamiltonian path (DHP) problem is one of the hard computational problems for which there is no practical algorithm on a conventional computer available. Many problems, including the traveling sales person problem and the longest path problem, can be translated into the DHP problem, which implies that an algorithm for DHP can also solve all the translated problems. To study the robustness of the laboratory protocol of the pioneering DNA computing for the DHP problem performed by Leonard Adleman (1994), we investigated how the graph size, multiplicity of the Hamiltonian paths, and the size of oligonucleotides that encode the vertices would affect the laboratory procedures. We applied Adleman's protocol with 18-mer oligonucleotide per node to a graph with 8 vertices and 14 edges containing two Hamiltonian paths (Adleman used 20-mer oligonucleotides for a graph with 7 nodes, 14 edges and one Hamiltonian path). We found that depending on the graph characteristics such as the number of short cycles, the oligonucleotide size, and the hybridization conditions that used to encode the graph, the protocol should be executed with different parameters from Adleman's.
Lee
C M
CM
Biological Research Information Center, Pohang University of Science and Technology, Korea.
Kim
S W
SW
Kim
S M
SM
Sohn
U
U
D000465:Algorithms; D019921:Biotinylation; D003205:Computing Methodologies; D004247:DNA / Q000737:chemistry; D017931:DNA Primers / Q000737:chemistry; D004274:DNA, Recombinant / Q000737:chemistry; D004277:DNA, Single-Stranded / Q000737:chemistry / Q000302:isolation & purification; D004738:Engineering; D008433:Mathematics; D009838:Oligodeoxyribonucleotides / Q000138:chemical synthesis / Q000737:chemistry / Q000302:isolation & purification; D016133:Polymerase Chain Reaction; D011897:Random Allocation; D019809:Streptavidin
D017931:DNA Primers; D004274:DNA, Recombinant; D004277:DNA, Single-Stranded; D009838:Oligodeoxyribonucleotides; D004247:DNA; D019809:Streptavidin