Application of DNA Nanoparticle Conjugation on the Hamiltonian Path Problem

Abstract

A DNA computing algorithm is proposed in this paper. The algorithm uses the assembly of DNA/Au nanoparticle conjugation to solve an NP-complete problem in the Graph theory, the Hamiltonian Path problem. According to the algorithm, I designed the special DNA/Au nanoparticle conjugations which assembled based on a specific graph, then, a series of experimental techniques are utilized to get the final result. This biochemical algorithm can reduce the complexity of the Hamiltonian Path problem greatly, which will provide a practical way to the best use of DNA self-assembly model.