Research And Exploration Of Satisfiability Problem Computing Model Based On DNA Origami

Nowadays computer science and technology develop at top speed,all kinds of nonlinear problems and NP complete problems appear in practical applications,but the existing electronic computer system can not deal with this kind of complex computing problems.In the process of information storage and processing in today's big data era,DNA molecules,with its advantages of specific hybridization and high parallel operation,can achieve high-capacity information storage and parallel operation through DNA computing,which provides a new way to solve complex computing problems and becomes a popular research field with wide application prospects.At the same time,Satisfiability problem(SAT problem)as one of the typical problems in the theory and application of computational science,has broad application background in many fields,such as artificial intelligence,software development,transportation,engineering technology and so on.This paper firstly introduces the development and research status of DNA computing,the background knowledge of DNA origami and the nano positioning of DNA origami,and the related knowledge of gold nanoparticles.Secondly,according to the characteristics of DNA origami—specific regions of long DNA strand can be folded into special structures,a DNA computational model is designed on the DNA origami to solve the solution of SAT problem,and according to the DNA strand displacement,another DNA computational model is designed to solve the solution of 0-1 integer programming problem.In these calculation models,the solution of the above satisfiability problem is directly expressed,and the molecular beacon principle is used to eliminate the non solution by observing the fluorescence extinction,so as to find out the solution of the problem.Through instances and simulation,proved that the models are highly feasible.By designing the path of the solution of the satisfiability problem,the two models are easy to operate and observe,and reduce the complexity of the satisfiability problem.Finally,this paper carry out a summary and explain the advantages and problems to be solved after the improvement.Figure[31]reference[56]...