摘要
DNA计算是基于DNA分子生化反应,能够在DNA计算机上实现的算法。它具有高度并行性、容量大、速度快等特点。同传统电子计算机一样,它也是以加、减、乘、除等简单算术运算和异或等逻辑运算为基本运算单元。在DNA自装配加法的基础上,设计了一般的DNA自装配并行减法模型,算法的时间复杂度为O(1),空间复杂度为O(n),并通过实例验证了算法的有效性。算法的主要优点在于编码简单、效率高,且具有通用性。
The algorithm based on biochemical reaction of DNA computing can process in a DNA computer. It has a high degree of parallelism, large capacity, and fast speed. Like the traditional electronic computer, it also takes ad- dition, subtraction, multiplication, division and logic operations as basic arithmetic unit. This paper proposes a gen- eral n-band parallel subtraction model of DNA self-assembly. The time complexity of proposed algorithm is O（1） and the space complexity is O（n）. As the same time, the effectiveness of the algorithm is verified by an illustration. The greatest advantage of this model is simple coding, high efficiency, and universal applicability.
出处
《计算机工程与应用》
CSCD
2012年第32期39-42,共4页
Computer Engineering and Applications
基金
国家重点基础研究发展规划(973)(No.2010CB731400)
国家自然科学基金(No.60904048)
国家博士后科学基金(No.20070420184)
湖南省自然科学基金(No.07JJ3128)
