DNA Codes Set Design Based On The ACO-RS Algorithm And BQC Algorithm

DNA computing is a parallel computing model based on DNA molecule and biological enzyme,it is a new computing method developed on the basis of computer technology and molecular biology.DNA computing has many advantages such as high parallelism,large storage density and low energy consumption.It provides a creative and enlightening way for solving NP complete problems.At present,scholars at home and abroad pay close attention to the development of DNA computing and actively participate in the research of DNA computing,and the technology of DNA computing has been developed from the theoretical stage to the application stage of biological experiments.High quality DNA codes can improve the fault-tolerance and stability of DNA computing,and sufficient DNA codes can satisfy the demand of large-scale application.The above two points correspond to two research contents of DNA codes: the quality optimization of DNA codes and the set design of DNA codes.The quality optimization of DNA codes refers to the screening of a certain number of high quality codes from the codes that satisfy the constraints;the DNA codes set design refers to constructing the codes that satisfy the constraint conditions as much as possible in known constraints and code lengths.The common constraints include combination constraints,thermodynamic constraints,and application oriented constraints.These constraints can effectively avoid the occurrence of unnecessary hybridization in the process of DNA computing,which helps to improve the stability and accuracy of DNA computing results.This paper focuses on the study of the set design of DNA codes,and the work is as follows:(1)The combination of ant colony algorithm and random search(ACO_RS)algorithm is used to design the DNA codes set.Using experimental data to explain the rationality of the one-dimensional ant transfer strategy model in the DNA codes design problem,thereby shortening the running time of the algorithm.The results obtained by the ant colony algorithm are used as initialization parameters of the random search algorithm,and the results of the ant colony algorithm are further expanded by the random search algorithm.By comparing the results of the ACO_RS algorithm with the published results of previous researchers,it is proved that the algorithm is effective and feasible.(2)A Bloch quantum chaos(BQC)algorithm is proposed to design the DNA codes set.The algorithm uses the chaotic equation to initialize the Bloch coordinates of quantum bits.At the same time,the operation of full interference crossover and mutation is also introduced in the algorithm to enhance the local search capability of the algorithm.Comparing the results obtained by the algorithm in this paper with the existing results,it is found that some of the results match the previous results,and some of the results are better than the previous results.