计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (32): 39-42.

• 研究、探讨 • 上一篇    下一篇

DNA计算机算术运算的自装配模型(III)—减法

孙守霞1,刘  伟2,郭  迎3,孟大志4   

  1. 1.鲁东大学 数学与信息学院,山东 烟台 264025
    2.上海交通大学 电子信息与电气工程学院,上海 200240
    3.中南大学 信息与通信工程,长沙 410083
    4.北京工业大学 应用数理学院,北京 100022
  • 出版日期:2012-11-11 发布日期:2012-11-20

Self-assembly model of simple arithmetic in DNA computing-
subtraction

SUN Shouxia1, LIU Wei2, GUO Ying3, MENG Dazhi4   

  1. 1.College of Mathematics and Information, Ludong University, Yantai, Shandong 264025, China
    2.School of Electronic Information and Electrical Engineering, Shanghai Jiaotong University, Shanghai 200240, China
    3.Department of Communication Engineering, Central South University, Changsha 410083, China
    4.College of Applied Science, Beijing University of Technology, Beijing 100022, China
  • Online:2012-11-11 Published:2012-11-20

摘要: DNA计算是基于DNA分子生化反应,能够在DNA计算机上实现的算法。它具有高度并行性、容量大、速度快等特点。同传统电子计算机一样,它也是以加、减、乘、除等简单算术运算和异或等逻辑运算为基本运算单元。在DNA自装配加法的基础上,设计了一般的DNA自装配并行减法模型,算法的时间复杂度为[O(1)],空间复杂度为[O(n)],并通过实例验证了算法的有效性。算法的主要优点在于编码简单、效率高,且具有通用性。

关键词: DNA计算机, 算术运算, 自装配, 减法

Abstract: 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 addition, subtraction, multiplication, division and logic operations as basic arithmetic unit. This paper proposes a general 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.

Key words: DNA computer, arithmetic, self-assembly, subtraction