Concerning DNA codewords design, the authors set up the mathematical model by analyzing the objectives and the restrictions that should be satisfied. A new codewords design method named the Improved Non-dominated Sorting Genetic Algorithm (INSGA- Ⅱ) was proposed by introducing the constraints to the non-dominated sorting process. The experiments demonstrate that INSGA- Ⅱ has higher convergence speed and better population diversity than those of NSGA, and can provide reliable and effective codewords for the controllable DNA computing.%针对DNA计算中的编码序列设计问题,分析了DNA编码序列设计的目标和需要满足的约束条件,并建立了相应的数学模型.通过将约束条件引入非支配排序过程,提出了一种改进的NSGA-Ⅱ算法.实验结果表明,该算法具有良好的收敛特性和种群多样性,能为可控的DNA计算提供可靠的编码序列.
展开▼