CAJ | 학술논문

针对DNA计算中的编码序列设计问题,分析了DNA编码序列设计的目标和需要满足的约束条件,并建立了相应的数学模型.通过将约束条件引入非支配排序过程,提出了一种改进的NSGA-Ⅱ算法.实验结果表明,该算法具有良好的收敛特性和种群多样性,能为可控的DNA计算提供可靠的编码序列.
침대DNA계산중적편마서렬설계문제,분석료DNA편마서렬설계적목표화수요만족적약속조건,병건립료상응적수학모형.통과장약속조건인입비지배배서과정,제출료일충개진적NSGA-Ⅱ산법.실험결과표명,해산법구유량호적수렴특성화충군다양성,능위가공적DNA계산제공가고적편마서렬.
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.