3D DNA Self-Assembly Algorithmic Model to Solve the Hamiltonian Path Problem
-
Published:2021-05-01
Issue:5
Volume:16
Page:731-737
-
ISSN:1555-130X
-
Container-title:Journal of Nanoelectronics and Optoelectronics
-
language:en
-
Short-container-title:Journal of Nanoelectronics and Optoelectronics
Affiliation:
1. School of Statistics, Shanxi University of Finance and Economics, Taiyuan, Shanxi 030000, China
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.
Publisher
American Scientific Publishers
Subject
Electrical and Electronic Engineering,Electronic, Optical and Magnetic Materials