3D DNA Self-Assembly Algorithmic Model to Solve the Hamiltonian Path Problem

Abstract

Self-assembly reveals the innate character of DNA computing, DNA self-assembly is regarded as the best way to make DNA computing transform into computer chip. This paper introduces a strategy of DNA 3D self-assembly algorithm to solve the Hamiltonian Path Problem. Firstly, I introduced a non-deterministic algorithm. Then, according to the algorithm I designed the types of DNA tiles which the computing process needs. Lastly, I demonstrated the self-assembly process and the experimental methods which can get the final result. The computing time is linear, and the number of the different tile types is constant.