论文部分内容阅读
DNA编码序列的质量与数量直接影响着DNA计算的可靠性和规模,如何找到尽可能好的及尽可能多的DNA序列用于实际的应用一直是DNA计算的一个核心问题.文中首先介绍了研究DNA编码和DNA序列集合对DNA计算的意义,并给出了DNA序列设计的汉明距离和反汉明距离约束条件的定义.DNA序列集合的研究对DNA计算的可靠性和规模有着重要的影响,因此文中利用遗传算法和动态遗传算法来设计满足上述约束条件的DNA序列集合,通过对两种方法所得结果的比较,证明了动态遗传算法明显优于遗传算法.与此同时,将文中所得到的实验结果与前人的研究成果进行比较可知,文中的结果大幅提高了DNA编码的上界,从而进一步缩小了DNA编码界的取值范围.并且文中所给出的实验结果,对以后DNA编码的理论界的研究以及编码理论中关于4元码界的研究,提供了重要的参考值.
The quality and quantity of DNA coding sequence have a direct impact on the reliability and scale of DNA computing.How to find the best possible and as many DNA sequences as possible for practical applications has been a core issue in DNA computing.Firstly, The significance of DNA coding and DNA sequence sets for DNA computing is also given and the definitions of the Hamming distance and anti-Hamming distance constraints of DNA sequence design are given.The research on DNA sequence sets has an important influence on the reliability and scale of DNA calculation , So in this paper, genetic algorithm and dynamic genetic algorithm are used to design a set of DNA sequences satisfying the above constraints, and the results of the two methods are compared to prove that the dynamic genetic algorithm is obviously better than the genetic algorithm.At the same time, Compared with previous research results, we can see that the result in the paper greatly improves the upper bound of DNA coding and further narrows the range of DNA coding, and the experimental results given in the paper show that the DNA coding The theoretical field of research and coding theory on the study of 4 yuan code, provides an important reference value.