摘要
DNA计算是解决一类难以计算问题的一种新方法,这种计算随着问题的增大可以呈指数增长。迄今为止,许多研究成果已经成功地提高了它的性能和增加了它的可行性,该文提出了在基于表面的DNA计算中采用了荧光标记策略,解决简单的0-1规划问题的一种理论方案,尝试了DNA计算在规划问题中的应用。这种方法具有编码简单、耗材底、操作时间短、技术先进等优点。
DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. In this paper, a theoretical scheme of solving 0-1 planning problem with fluorescence labeling technique given and used to apply DNA computing to planning problem. This method has some significant advantages such as simple encoding, low cost, short operating time, etc.
出处
《电子与信息学报》
EI
CSCD
北大核心
2003年第1期62-66,共5页
Journal of Electronics & Information Technology
关键词
0-1规划
DNA计算
可行解
荧光标记技术
电子计算机
DNA Computing, 0-1 planning problem, Feasible solution, Fluorescence labeling technique
