摘要
在DNA计算中,DNA编码序列的设计是DNA计算的重要手段。在不同的DNA序列设计中,需要选择适当的约束条件,给出满足该约束条件的评估公式。本文选择海明距离和反海明距离约束条件,利用遗传算法和改进的遗传算法来设计满足这两个条件的DNA编码序列,通过结果的比较,证明了改进的遗传算法优于遗传算法。
In the calculation of DNA, DNA sequence design is an important means for DNA computing. In the design of DNA sequences in different, need to choose the proper constraint conditions are satisfied, the evaluation formula of the constraint conditions. This paper chooses Hamming distance and Hamming distance constraint conditions, using genetic algorithm and improved genetic algorithm to design the DNA coding sequence satisfy these two conditions, by comparison the results, proved that genetic algorithm is better than the improved genetic algorithm.
出处
《科技视界》
2014年第11期24-25,共2页
Science & Technology Vision
基金
安徽省高校青年优秀人才基金资助项目(2012SQRL259)
关键词
DNA计算
DNA编码
组合优化
遗传算法
DNA computing
DNA encoding
Combinational optimization
Genetic algorithm