The Application Of Self-assembly Technology In DNA Computing

DNA computing is based on the development of molecular biology.Unlike traditional computing methods,DNA computing uses DNA molecules as a medium to perform various computational processes.With the help of DNA molecules,high storage capacity and huge parallelism,DNA computers are expected to break through the shortcomings of traditional computer development and provide a better solution for problems that traditional computers cannot solve.This paper mainly studies the application of DNA self-assembly technology in the vertex coloring problem of the graph theory and the application of the largest cluster problem.Firstly,it describes the development background,basic ideas and current research status of DNA computing,and lists the contents of this paper.By introducing some basic knowledge and operation methods in DNA computing,it lays a theoretical foundation for the establishment of later models;Then through the introduction of the research and development process of DNA self-assembly technology and the application prospects,and expound the important media in the DNA self-assembly process:self-assembled nanoparticles and triple-stranded DNA.DNA self-assembly technology,as a method in biological computing,has a strong application value in the N-P problem.In this paper,the vertex coloring problem of self-assembled nanoparticles is used to solve the graph and the maximum cluster problem is solved by using three-strand DNA.In solving the vertex coloring problem of graphs,the paper successfully established a model for solving the vertex coloring problem of graphs by using self-assembled nano-metal particles.First,the vertices of the graph are self-assembled;secondly,the corresponding connected probes are constructed according to the vertices,and the initial data pool is automatically generated by base complementary pairing;finally,the special structure of the delete probe is used in the data pool.Screening was performed in combination with gel electrophoresis to obtain a solution that satisfies the conditions.The model does not need to encode the DNA fragments,and the operation is simple,and no enzyme participation is involved in detecting the solution,which reduces the complexity and improves the calculation efficiency.In solving the maximum group problem,the vertices in the largest group problem are first coded into DNA fragments,biochemical reactions are carried out,combined into all possible cases,and then the solution is screened by the three-chain model to obtain the largest group of the graph.This model reduces the complexity of the coding and improves the detection efficiency.Other N-P problems can also be solved by this method.DNA molecules are representative nanomaterials,and their physical properties and biological properties are beyond the reach of other materials.Using DNA calculation,the preparation method is simple,the operation sensitivity is high,the complexity is low,and the cost is small and developable.When solving a problem with a complex problem,it is possible to perform matching and generation spontaneously,and it is operable.Figure[25]table[1]reference[62]...