Research On Coding Methods For DNA Computing

DNA computing is a novel kind of computing model.It has attracted the attention of domestic and foreign scholars in recent years,to carry out research and exploration on DNA computing.The uniqueness of the DNA computing model calculation idea is that it first converts the information to be processed into the form of DNA molecules,then uses the specific pairing between the DNA molecules,and finally processes the DNA molecules by a variety of biochemical technologies.Then the results are converted back into information to obtain the operation results.Thanks to the biological characteristics of DNA,DNA computing has a high degree of parallelism,a high degree of information storage density,and reliable long-term storage capabilities.It is expected to solve NP-hard problems such as travel salesman,the problem of insufficient data storage capacity,etc.It is even expected to replace the traditional electronic computer,and become a new computing method.DNA coding design is a basic work of DNA computing.The sequence code with excellent characteristics can significantly reduce the melting temperature and the probability of mismatch hybridization,and improve the stability and efficiency of DNA computing.It has a great significance for the realization of DNA computing.The coding design problem is a multi-object and multi-constraint NP-hard problem.In order to obtain a DNA coding with low melting temperature and low similarity,the hairpin structure,GC base content,continuity,etc.are constraints.In response to this NP-hard problem,this paper designs and implements two methods to improve DNA coding.1.For the problems of high melting temperature and high mismatch hybridization of the DNA coding methods,a coding design method based on BFA is proposed.The continuous chemotactic process of BFA method is used to reduce the melting temperature and similarity.In addition,we can retain the codes with excellent characteristics by replication characteristics and eliminating the bad codes.Effectively reduce the melting temperature and similarity of DNA strands,and then effectively improve the experimental efficiency and reduce the chance of mismatch.2.For the problem of DNA strand melting temperature optimization process,it may lead to the increase in the probability of mismatch,and the problem of low code acquisition efficiency caused by weak BFA convergence,a coding design method based on BFA-AC is proposed.Extended BFA by introduced activity control mechanism and the competition exclusion mechanism.Effectively reduce the probability of mismatch,further reduce melting temperature,effectively improve the convergence of algorithm,and the code acquisition efficiency.This paper solves the problems of high melting temperature and high similarity in coding design in DNA computing by BFA and BFA-AC methods.It provides new research ideas for the acquisition of codes with excellent characteristics,and also brings a certain promoting effect to the research and implementation of DNA computing,and has high research value and application value.