Dna Data Structures In Computer Design And Research

Since Adleman proposed DNA computing, it is much easy for people to solve certain complex problems such as NP-complete problems. This new concept of calculation differentiates from the conventional ones, prospered intelligent calculation method. DNA computer is a new computer which simulates the structure of DNA of biological molecules. This DNA computing can provides a theoretical support for practicability of DNA computer. If DNA computer want to realize its practicability, it must be the same as a traditional computer. In order to settle the issues of representation and organizational in DNA computer, we need a reasonable data structures to effectively organize the information of DNA computer, Research of DNA computing in theoretical and applied studies will greatly promote the development of the theory on the new compute.In this paper, based on studying DNA Computation Theory, successfully solve some fundamental and important issues, such as data structure graph theory, queues, stacks and trees. Proposed IMCE (Incompledion-Molecule Commixed Encoding) computing model to resolve the problem of the shortest path. Designed a plan to use DNA computing to solve the minimum spanning tree of the calculation model, and describe the solution of calculation process of MSTP. Proposed a design method of stack data structure in DNA computer, this method used ring DNA moleculers to express the option constraint of stack originality, and uses two different restriction enzymes to complete stack'push and pop operations, given the form of stack storage structure description in DNA computer. We illustrated the biological realization method of initializing stack, pushing, and popping and other operations in DNA computing. We also provided a specific example of DNA encoding and algorithms which simulated the operating mechanism of algorithm DNA computer. The experiment confirmed the feasibility of this method. Proposed a design method of the binary tree data structure which storaged by sequence mode in DNA computer, provided a specific example and code of Binary Tree in DNA computer, the experiment confirmed the feasibility of this method.