Research On Graph Connectivity Model Based On DNA Strand Displacement And Self - Assembly Technique

Because of the storage and parallelism based on Si-based computer limitations, the top priority should be to develop the high performance computers. The new technologies such as DNA computing and quantum computing are developing. Comparing with the traditional computer, DNA computing is an efficient calculation model, which is based on the DNA molecule as a vehicle for data storage and operation. With the development of science and technology, the experts constructed the DNA molecule model, design algorithm and biochemical test research. Of course, they can solve some NP-problems in graph theory.The paper constructs two DNA self-assembly model to solve the connectivity problem. The paper also described the principle of the DNA computing and its advantages. We selected two calculating model to solve the connectivity.First, this paper constructs double-stranded DNA molecular model. According to the simple algorithm, We build the DNA molecule to avoid the index growth of the vitro. The paper uses the simple graph G to validate the algorithm, which shows the whole operation process of this algorithm to solve the connectivity. Of course, we give the biochemical process of the double-stranded DNA molecular and algorithm of the model. This paper is constructed with a computing model to solve the connectivity with n nodes by taking advantage of the DNA strands. Different from conventional algorithm, the current algorithm is high efficiency as its time is O((n-1)n/2+m) without exponentially increasing.Second, we build the 3D DNA self-assembled computing model-DNA/AuNPs copolymers to solve the connectivity of graph in this paper. According to design the algorithm, we need design the model of the specific graph. Then, according to the algorithm process through a series of experiments, we can solve connectivity problems. In addition, this paper has carried on the simulation through the Visual DSD and NUPACK about the biological experiment to illustrate the feasibility of the experiment. Compared with the traditional computers, the algorithm reduces the complexity of the calculation. And biochemical experiment technology is mature and easy operation. Most important, the application of the DNA self-assembled model provides a feasible scheme.The paper can prove the double-stranded DNA molecules model and DNA/AuNP copolymer model to solve the connectivity through the contrast with the literatures and detailed biotechnology operation process.In addition, this reseach connected the DNA molecules with the Au nanoparticles by the strand displacement, it proved that the control of the gold nanoparticles also have been up to the new standard. Most important, the models can improve the reliability and accuracy of molecular computing in theory. The field of molecular computing have attracted to attentions from lots of researchers to solve the NP-complete problems in graph theory because of the flexible operation of the experiment and high accuracy. However, this paper must use the specific graph to design the model. Although there is a Visual DSD simulation to verify the feasibility of the experiment, it can’t use the specific biochemical experiments to verify the feasibility of the model.