Lower Bounds of DNA Codes with Reverse Constraint
Lower Bounds of DNA Codes with Reverse Constraint
复制标题
具有反向约束的 DNA 代码下界
DOI：
10.1166/jctn.2010.1587
复制
发表时间：
2010-10
影响因子：
--
通讯作者：
Xu, Chunxia
中科院分区：
文献类型：
--
作者：
Zhang, Qiang;Xu, Chunxia
DNA编码设计一直是DNA计算领域的研究热点，它对于减少不同字及其互补字之间的非特异性杂交所造成的错误，提高DNA计算的精度和应用范围具有重要作用。然而，DNA序列的数量非常庞大，到目前为止，还没有提出有效的构造满足一定约束条件的DNA序列的方法。因此，为了获得最大规模的DNA序列集，一些非穷举搜索算法已经被提出。本文采用蜂群进化遗传算法（BSEGA）设计满足海明距离、反向海明距离和GC含量约束的DNA代码，引入蜜蜂繁殖进化机制。从我们的系统得到的结果是优于以前已知的系统。改进了DNA编码的下界，证明了算法的有效性和收敛性。
DNA codes design is always a research hot topic in DNA computation because it plays an important role in minimizing errors due to non-specific hybridization between distinct words and their complements and improving the accuracy and application scope of DNA computation. However, the number of DNA sequences is very large and so far the effective constructive method of DNA sequences which satisfy some constraints has not been proposed. Therefore, for obtaining the largest sizes of DNA sequence sets, some non-exhaustive search algorithms have been proposed. In this paper, the bee swarm evolutionary genetic algorithm (BSEGA) is adopted to design DNA codes satisfying Hamming distance, reverse Hamming distance and GC content constraint, which introduced the mechanism of honeybee's reproduction evolution. The results obtained from our system are better than the previous known systems. And they improve the lower bounds of DNA codes and also prove the efficiency and convergence of our algorithm.