Solution of the knapsack problem by deoxyribonucleic acid computing

被引：6
|
作者：
Aoi, Y
Yoshinobu, T
Tanizawa, K
Kinoshita, K
Iwasaki, H
机构：
[1] Osaka Univ, Inst Sci & Ind Res, Ibaraki, Osaka 5670047, Japan
[2] Osaka Univ, Dept Appl Phys, Suita, Osaka 5650871, Japan
来源：
JAPANESE JOURNAL OF APPLIED PHYSICS PART 1-REGULAR PAPERS SHORT NOTES & REVIEW PAPERS | 1998年 / 37卷 / 10期
关键词：
DNA computing; DNA; computing; knapsack problem; ligation; PCR; polymerase chain reaction;
D O I：
10.1143/JJAP.37.5839
中图分类号：
O59 [应用物理学];
学科分类号：
摘要：
Deoxyribonucleic acid (DNA) computing is executed to demonstrate that it is capable of solving a simple instance of the knapsack problem, which is known to be NP-complete. DNA molecules with different lengths coding the data are prepared, and the algorithm is implemented as molecular biological processes such as ligation,polymerase chain reaction (PCR), and DNA sequencing. The scheme of encoding, experimental procedures and results are described, and the scalability of the present method is discussed. Reactions between DNA molecules are expected to realize a massively parallel computation of the order of 10(23) per mol.
引用
收藏
页码：5839 / 5841
页数：3
相关论文
共 50 条
  • [31] Using the multiple knapsack problem to model the problem of virtual machine allocation in cloud computing
    Martins Amarante, Silvio Roberto
    Roberto, Filipe Maciel
    Cardoso, Andre Ribeiro
    Celestino, Joaquim, Jr.
    2013 IEEE 16TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE 2013), 2013, : 476 - 483
  • [32] APPLIED PROGRAM PACKAGE FOR APPROXIMATE SOLUTION OF THE MULTIDIMENSIONAL KNAPSACK-PROBLEM (KNAPSACK-INTERACTION)
    DUMBADZE, LG
    YEVDOKIMOV, MV
    TIZIK, AP
    TSURKOV, VI
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1992, 30 (02): : 13 - 17
  • [33] Solution of a problem in DNA computing
    Anderson, E
    Chrobak, M
    Noga, J
    Sgall, J
    Woeginger, GJ
    THEORETICAL COMPUTER SCIENCE, 2002, 287 (02) : 387 - 391
  • [34] Generalized quadratic multiple knapsack problem and two solution approaches
    Sarac, Tugba
    Sipahioglu, Aydin
    COMPUTERS & OPERATIONS RESEARCH, 2014, 43 : 78 - 89
  • [35] A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem
    He, Jun
    Mitavskiy, Boris
    Zhou, Yuren
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 141 - 148
  • [36] ON THE SOLUTION OF MULTIDIMENSIONAL INTEGER KNAPSACK PROBLEM WITH DYNAMIC PROGRAMMING TECHNIQUE
    Nuri, Elnur
    Nuriyeva, Fidan
    Nuriyev, Urfat
    PROCEEDINGS OF THE7TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL. 1, 2020, : 302 - 304
  • [37] A Lagrangean based solution algorithm for the multiple knapsack problem with setups
    Amiri, Ali
    Barkhi, Reza
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 153
  • [38] Quick evaluation of the efficient solution set for the biobjective knapsack problem
    Gandibleux, X
    MULTIPLE CRITERIA DECISION MAKING IN THE NEW MILLENNIUM, 2001, 507 : 254 - 264
  • [39] DENATURATION OR DISSOCIATION OF DEOXYRIBONUCLEIC ACID IN DILUTE SOLUTION
    OTH, A
    BIOCHIMICA ET BIOPHYSICA ACTA, 1959, 35 (01) : 216 - 225
  • [40] SOLUTION OF THE ZERO-ONE MULTIPLE KNAPSACK-PROBLEM
    MARTELLO, S
    TOTH, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 4 (04) : 276 - 283
12345