Search computing model for the knapsack problem based on DNA origami

被引：7

作者：

Yang, Jing ^{[1
,2
]}

Yin, Zhixiang ^{[3
]}

Tang, Zhen ^{[1
]}

Huang, Kaifeng ^{[4
]}

Cui, Jianzhong ^{[5
]}

Yang, Xinmu ^{[1
]}

机构：

[1] Anhui Univ Sci & Technol, Sch Math & Big Data, Huainan 232001, Peoples R China

[2] Univ Hong Kong, Fac Educ, Hong Kong 999077, Peoples R China

[3] Shanghai Univ Engn Sci, Sch Math Phys & Stat, Shanghai 201620, Peoples R China

[4] Huainan Normal Univ, Sch Mech & Elect Engn, Huainan 232001, Peoples R China

[5] Anhui Univ Sci & Technol, Sch Elect & Informat Engn, Huainan 232001, Peoples R China

来源：

MATERIALS EXPRESS | 2019年 / 9卷 / 06期

基金：

中国国家自然科学基金;

关键词：

Hybridization Chain Reaction; DNA Origami; Knapsack Problem; Search Computing Model; HYBRIDIZATION CHAIN-REACTION; REACTION AMPLIFICATION;

D O I：

10.1166/mex.2019.1530

中图分类号：

TB3 [工程材料学];

学科分类号：

0805 ; 080502 ;

摘要：

The knapsack problem is an import NP-complete problem in combinatorial optimization. In order to reduce the complexity of the problem, we provide a search computing model based on DNA origami to solve it. In this paper, we map the choice of each item to the directed path on the origami base of DNA. Then the solution of the problem is mapped to find a directed path to maximize the total value of items in the knapsack. Hybrid chain reaction and fluorescence detection techniques are used to generate solutions satisfying constraints. Lastly, we use Visual DSD simulation software to verify the validity of the model. Compared with other models through simulation, this model can automatically search the solution of the problem, and really reduce the complexity of the problem to linear.

引用

页码：553 / 562

页数：10

共 50 条

[1] A DNA Computing Algorithm for Solving the Knapsack Problem
Ye, Lian
[J]. INFORMATION AND BUSINESS INTELLIGENCE, PT II, 2012, 268 : 84 - 90
[2] A Visualized DNA Origami Computing Model-Solving Satisfiability Problem
Cui, Jianzhong
Yin, Zhixiang
Zhang, Qiang
Tang, Zhen
Yang, Jing
[J]. BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2020, 127 : 117 - 117
[3] Molecular solution to the 0-1 knapsack problem based on DNA computing
Darehmiraki, Majid
Nehi, Hasan Mishmast
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 187 (02) : 1033 - 1037
[4] Based on DNA Self-Assembled Computing to Solve MH Knapsack Public Key Cryptosystems of the Knapsack Problem
Liu, Jing
Yin, Zhixiang
[J]. Advances in Intelligent Systems and Computing, 2013, 212 : 975 - 983
[5] Solution to the 0-1 Knapsack Problem based on DNA Encoding and Computing Method
Ye, Lian
Zhang, Min
[J]. JOURNAL OF COMPUTERS, 2013, 8 (03) : 669 - 675
[6] Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem
Tsai, Sientang
[J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 416 - 427
[7] COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM
HOROWITZ, E
SAHNI, S
[J]. JOURNAL OF THE ACM, 1974, 21 (02) : 277 - 292
[8] A tree search based combination heuristic for the knapsack problem with setup
Khemakhem, Mahdi
Chebil, Khalil
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 280 - 286
[9] 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.
[J]. 2013 IEEE 16TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE 2013), 2013, : 476 - 483
[10] DNA computation with Knapsack Problem
Shi, XL
Jin, X
[J]. PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 189 - 192

← 1 2 3 4 5 →