DNA Sequence Set Design Based On The New Constraint Combination

With the rapid growth of data,the traditional computers have reached the limit in terms of data storage and computing rate.At this time,DNA computers have attracted widespread attention with the advantages of small size,large computing capacity and high storage capacity.As an important operation mode in DNA computer,DNA computing is a new method to solve complex problems based on molecular biotechnology.The research of DNA computing lays a strong foundation for researchers to develop molecular computer and provides a good way to realize DNA intelligent computer.The core of DNA computing is the molecular hybridization reaction,and improving the accuracy of molecular hybridization requires seeking high quality DNA sequences.Therefore,this paper uses heuristic algorithm to construct DNA sequence set that meets the standard.In this paper,we analyze the previously constructed DNA sequences and perform evaluation with the help of NUPACK software,from which we find the problems of DNA sequences in molecular hybridization reactions and propose new constraints to optimize DNA sequences.In addition,combined with the new algorithm,a DNA sequence set meeting the new constraint combination is designed to improve the quality of DNA coding and the accuracy of DNA calculation.The work of this paper is introduced as follows:(1)Triplet-bases unpaired constraint is proposed to reduce the probability of occurrence of the complementary pairing structure of DNA in solution.In addition,adding the Harmony Search Algorithm(HS)to the Whale Optimization Algorithm(WOA)avoids the shortcomings of the WOA algorithm that it is easy to reduce reduce the probability of WOA falling into local.The newly proposed whale optimization algorithm based on harmony search(HSWOA)combined with the new combination constraint of Triplet-bases unpaired constraint to obtain the sequence set,which improving the efficiency of the hybridization reaction.(2)In order to avoid the reaction of base complementary pairing reaction between DNA sequence set in solution,a pairing sequence constraint is proposed.In the double stranded structure of DNA,the DNA sequence and its complementary sequence are G-C bases at both ends,which has higher stability,Pairing sequence constraint is proposed.At the same time,a new predator-prey method of Somersault foraging is added to the Whale Optimization Algorithm(WOA)to expand the predator-prey range of the individual whale,and the chaotic sine cosine mathematical model is introduced to increase the global optimization ability,improve the coverage of the solution space and the global search ability.In this paper,using the Whale Optimization Algorithm based on chaos optimization(ICW)combined with Pairing sequence constraint and Close-ending constraint,DNA sequence set that is superior to the previous results is constructed.