基于动态遗传算法的DNA序列集合设计

摘要

Both the quality and the quantity of DNA coding sequences immediately affect the reli-ability and the scale of DNA computing,and how to find more and better DNA sequences which are used in practical applications is the key problems in DNA computing.This paper firstly intro-duces the significance of DNA coding and DNA sequences sets for DNA computing,and then gives the definitions of the Hamming distance and reverse Hamming distance constraints.The re-search of DNA sequences sets has important effect on the reliability and the scale of DNA compu-ting,so we use genetic algorithm and dynamic genetic algorithm were used to design the largest DNA sequence sets which satisfy Hamming distance and reverse Hamming distance combinatorial constraints.Comparing the results which are obtained by the two algorithms,it can be proven that the dynamic genetic algorithm is markedly better than genetic algorithm.At the same time,by comparing the obtained experimental results with the previous works,the obtained results im-prove the upper bounds of DNA coding,and further shorten the value range of DNA coding bounds.Furthermore,the results provide a guide for the research of theoretical bounds in DNA coding and the bounds of 4-ary in coding theory.%DNA编码序列的质量与数量直接影响着DNA计算的可靠性和规模,如何找到尽可能好的及尽可能多的DNA序列用于实际的应用一直是DNA计算的一个核心问题.文中首先介绍了研究DNA编码和DNA序列集合对DNA计算的意义,并给出了DNA序列设计的汉明距离和反汉明距离约束条件的定义.DNA序列集合的研究对DNA计算的可靠性和规模有着重要的影响,因此文中利用遗传算法和动态遗传算法来设计满足上述约束条件的DNA序列集合.通过对两种方法所得结果的比较,证明了动态遗传算法明显优于遗传算法.与此同时,将文中所得到的实验结果与前人的研究成果进行比较可知,文中的结果大幅提高了DNA编码的上界,从而进一步缩小了DNA编码界的取值范围.并且文中所给出的实验结果.对以后DNA编码的理论界的研究以及编码理论中关于4元码界的研究,提供了重要的参考值.