Dynamic DNA Origami Computing Model Based On 0-1 Programming

DNA origami is a new DNA self-assembly method proposed in recent years.Because it can construct highly complex nano patterns or structures,it has a wide range of potential applications in the emerging nano field.DNA is considered to be one of the most promising materials for the construction of molecular machines due to its many advantages,such as sequence programmability,whole molecule modifiability,diversity of secondary structures and precise addressability.DNA walkers,as a new kind of dynamic DNA molecular machine,are also the research hotspot in recent years.They are widely used in the detection of nucleic acids and proteins,and show great application prospects in the fields of biosensor,biological imaging,assembly and synthesis of new materials,drug delivery,life process monitoring and biological computers.By combining DNA walkers with DNA origami,we can construct a variety of origami computing models for DNA walkers,which can solve many DNA biological computing problems,such as integer programming,satisfiability,logic gate,etc As one of the most important problems in operational research,0-1 programming is a hot topic in DNA computing.This paper mainly studies DNA walkers model based on DNA origami to solve 0-1 planning problem.The research contents and main successes include:1.The research status and significance of DNA computing are discussed.The molecular structure of DNA and some basic operations are introduced;2.The development and principle of DNA origami and DNA walkers are introduced;3.The knowledge of 0-1 integer programming is introduced;4.Two dynamic models based on DNA origami to solve 0-1 integer programming problem are constructed;5.DNA origami technology and DNA walkers to solve NP complete problems are summarized and the prospect is prospectedIn this paper,two computational models of DNA walkers and DNA origami to solve the 0-1 programming problem are constructed,which enrich and expand the DNA computing method to solve the 0-1 programming problem.Figure[30]reference[90]...