Designing DNA Sequences Satisfing Combinational Constraints
Designing DNA Sequences Satisfing Combinational Constraints
复制标题
设计满足组合约束的 DNA 序列
DOI：
10.1166/jctn.2010.1461
复制
发表时间：
2010-06
影响因子：
--
通讯作者：
Wang, Bin
中科院分区：
文献类型：
--
作者：
Zhang, Qiang;Wang, Bin
DNA计算是一种不同于传统计算模型的新型计算模型，它以DNA序列作为存储信息的材料，以杂交反应为计算原理。杂交反应的准确性直接影响DNA计算的可靠性和准确性。由于生物技术的局限性，假杂交反应的出现是无法避免的。为了减少假杂交的出现，许多研究人员设计了满足约束条件的DNA序列。本文利用改进的动态遗传算法来设计满足Hamming距离和h-距离组合约束的DNA序列。根据已知的理论值，我们的实验结果改进了满足这两个约束的下界，并进一步缩短了范围。更重要的是，使用我们的结果可以减少假杂交反应的出现，提高DNA计算的可靠性和规模。
DNA computing is a new computational model which is different from the traditional computational model and it uses the DNA sequences as the materials of information storage and hybridization reaction as computational principle. The accuracy of hybridization reaction immediately affects the reliability and the accuracy of DNA computing. Because of the limit of biologic technology, the emergence of false hybridization reaction is impossible to avoid. To decrease the emergence of false hybridization, many researchers design DNA sequences which satisfy constraints. In this paper, we use improved dynamic genetic algorithm to design DNA sequences which satisfy Hamming distance and h-distance combinational constraints. According to the known theoretical value, our experimental results improve the lower bounds which satisfy both constraints and further shorten the range. More importantly, using our results can decrease the emergence of false hybridization reaction, and improve the reliability and the scale of DNA computing.