计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2015年
2期
135-140
,共6页
DNA计算%DNA编码%遗传算法%聚类分析%小生境%模运算
DNA計算%DNA編碼%遺傳算法%聚類分析%小生境%模運算
DNA계산%DNA편마%유전산법%취류분석%소생경%모운산
DNA computing%DNA coding%genetic algorithm%clustering analysis%niche%modular operation
DNA编码优化问题是DNA计算中的核心问题。分析DNA编码优化的约束条件，在单链DNA序列集合上引入h距离，将聚类小生境技术应用于小种群遗传算法的构造，对DNA编码优化问题进行求解。基于h距离定义DNA序列间的相似函数，将碱基字母编码为4进制整数、DNA编码序列作为个体编码为4进制整数向量、种群编码为4进制整数矩阵，基于模4算术运算，构造相应的遗传算子，并给出DNA编码序列的具体计算结果。实验结果表明，与现有DNA编码序列优化结果相比，该算法可得到更好的DNA编码序列且计算效率较高。
DNA編碼優化問題是DNA計算中的覈心問題。分析DNA編碼優化的約束條件，在單鏈DNA序列集閤上引入h距離，將聚類小生境技術應用于小種群遺傳算法的構造，對DNA編碼優化問題進行求解。基于h距離定義DNA序列間的相似函數，將堿基字母編碼為4進製整數、DNA編碼序列作為箇體編碼為4進製整數嚮量、種群編碼為4進製整數矩陣，基于模4算術運算，構造相應的遺傳算子，併給齣DNA編碼序列的具體計算結果。實驗結果錶明，與現有DNA編碼序列優化結果相比，該算法可得到更好的DNA編碼序列且計算效率較高。
DNA편마우화문제시DNA계산중적핵심문제。분석DNA편마우화적약속조건，재단련DNA서렬집합상인입h거리，장취류소생경기술응용우소충군유전산법적구조，대DNA편마우화문제진행구해。기우h거리정의DNA서렬간적상사함수，장감기자모편마위4진제정수、DNA편마서렬작위개체편마위4진제정수향량、충군편마위4진제정수구진，기우모4산술운산，구조상응적유전산자，병급출DNA편마서렬적구체계산결과。실험결과표명，여현유DNA편마서렬우화결과상비，해산법가득도경호적DNA편마서렬차계산효솔교고。
The optimization of DNA coding plays an important role in DNA computing. In this paper,the constraints of the optimization of DNA coding are described, an h distance is introduced over the set of single DNA strands and a clustering-based niche technique is applied to construct the micro-genetic algorithm which is used to solve the problem of the optimization of DNA coding. In the algorithm,a similarity function between different DNA sequences is defined based on the h distance. The base letters are encoded by quaternary integers, the DNA coding sequences are encoded by the vector of quaternary integers as individuals and the population is encoded by the matrix of quaternary integers. Several genetic operators are constructed based on modulo 4 arithmetic operation and the concrete computing results are presented. Experimental results show that compared with the latest results, the algorithm can get better DNA coding sequences and improve the efficiency of computation.
