Application of DNA Self-Assembly on 0-1 Integer Programming Problem

被引：5
|
作者：
Zhang, Xuncai [1 ,2 ]
Niu, Ying [1 ]
Cui, Guangzhao [1 ]
Xu, Jin [2 ]
机构：
[1] Zhengzhou Univ Light Ind, Coll Elect & Elect Engn, Zhengzhou 450002, Peoples R China
[2] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China
来源：
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE | 2010年 / 7卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Self-Assembly; 0-1 Integer Programming Problem; DNA Tile; Parallel Computing; DNA Computing; COMPUTATION;
D O I：
10.1166/jctn.2010.1341
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
Self-assembly of DNA is an efficient method of executing parallel DNA computing where information is encoded in DNA tiles and a large number of tiles can be self-assembled via sticky end associations We investigate how basic ideas on tiling can be applied to solving 0-1 integer programming problem. It suggests that these procedures can be realized on the molecular scale through the medium of self-assembled DNA tiles. By creating billions of billions of copies of the participating DNA tiles, the algorithm will run in parallel on all possible solutions. The potential of DNA computing by self-assembly for the 0-1 integer programming problem is promising given the operational time complexity of O(m * n). This work shows further evidence for the ability of DNA computing to solve NP-complete problems
引用
收藏
页码：165 / 172
页数：8
相关论文
共 50 条
  • [31] Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem
    Billionnet, Alain
    Elloumi, Sourour
    MATHEMATICAL PROGRAMMING, 2007, 109 (01) : 55 - 68
  • [32] Optimizing model of the redeposit direction - The special 0-1 linear integer programming problem
    Gao, Tian
    Wang, Meng-Guang
    Tang, Li-Xin
    Song, Jian-Hai
    Kongzhi yu Juece/Control and Decision, 2001, 16 (SUPPL.): : 705 - 708
  • [33] Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
    Alain Billionnet
    Sourour Elloumi
    Mathematical Programming, 2007, 109 : 55 - 68
  • [34] NETWORK SCHEDULING PROBLEM WITH LIMITED RESOURCES - (0-1) INTEGER PROGRAMMING APPROACH.
    Fukuma, Toshiko
    Yamamoto, Masaaki
    Bulletin of The College of Engineering, Hosei University, 1983, (19): : 161 - 170
  • [35] The general form of 0-1 programming problem based on DNA computing
    Yin, ZX
    Zhang, FY
    Xu, J
    BIOSYSTEMS, 2003, 70 (01) : 73 - 78
  • [36] Application of DNA self-assembly for maximum matching problem
    Kou Z.
    Zhang H.
    Qiang X.
    Lan W.
    Zhang K.
    Qiang, Xiaoli, 2016, American Scientific Publishers (13) : 3562 - 3567
  • [37] Application of DNA Self-assembly for Maximum Matching Problem
    Zhang, Hui
    Qiang, Xiaoli
    Zhang, Kai
    BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2015, 2015, 562 : 621 - 630
  • [38] CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM
    GLOVER, F
    WOOLSEY, E
    OPERATIONS RESEARCH, 1974, 22 (01) : 180 - 182
  • [39] Application of DNA Self-assembly on Maximum Clique Problem
    Cui, Guangzhao
    Li, Cuiling
    Li, Haobin
    Zhang, Xuncai
    Li, Xiaoguan
    ADVANCES IN COMPUTATIONAL INTELLIGENCE, 2009, 61 : 359 - +
  • [40] Application of DNA Self-Assembly on Graph Coloring Problem
    Zhang, Xuncai
    Niu, Ying
    Cui, Guangzhao
    Xu, Jin
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2009, 6 (05) : 1067 - 1074
12345