Self-assembled Dna Computing Model And Its Application

The development of electronic computer is restrained by the hardware technique and manufacture cost, which spur scientists to investigate new information processing mode. Biological computing receives more and more attention, especially the DNA computing mode. DNA computing is a kind of new molecular computing method which uses DNA molecules and some relevant enzymes as basic materials and follows the biochemical reactions to complete computation. More than ten years of research reveals that DNA computing has some special advantages such as intrinsic parallelism and massive information storage capability and so on when applying it to solve some NP-complete problems in Graph and combinational optimization. Due to its superiority, DNA computing is supposed to make a breakthrough and have more and more innovation and application on optimization computing, Cryptography, Mathematics and so on in the future’s scientific researching area. Currently the international research about DNA computing is becoming a new scientific frontier and hotspot, which draws the attention of scientists from different majors and areas dramatically, especially the scientists from Biological Engineer. Computer Science, Mathematics, Physics, Chemistry, Control Science and Information Science and so on.The aim of this study is to investigate how to use the special properties of DNA molecules and the varied biological technologies and nanotechnology to establish computing models which could solve some NP-complete problems, especially the current self-assembly algorithm model. These models not only provide the distinct algorithms to solve the NP-complete problems such as Graph and combinational optimization problems and so on, but also could reduce the computing complexity and overcome the exponential explosion problem which the electronic computer can not solve at present. This research is of great theoretical value and potential application.The mainly work of this study includes the two models as follows:(1) The first one is a DNA3D self-assembly algorithm model to solve the Maximum Clique Problem. Firstly, we introduce a non-deterministic algorithm. Then, according to the algorithm we design the types of DNA tiles which the computation needs. Lastly, we demonstrate the self-assembly process and the experimental methods which could get the final result. The computation time is linear, and the number of the distinctive tile types is constant.(2) The second one is a DNA computing algorithm which uses the assembly process of DNA/Au nanoparticle conjugate to solve an NP-complete problem in the Graph theory, the connectivity problem, and a3D DNA self-assembly algorithm model is also established. According to the algorithm we need to design the special DNA/Au nanoparticle conjugate which will assemble based on a specific graph, then a series of experiments are performed to get the final answer. This biochemical algorithm could reduce the complexity of the connectivity problem, the biochemical experimental technologies are mature and available, which will provide a practical way to the best use of DNA self-assembly algorithm model.