Solving 0-1 Integer Programming Problem Based on DNA Strand Displacement Reaction Network

被引：13

作者：

Tang, Zhen ^{[1
]}

Yin, Zhixiang ^{[1
,4
]}

Wang, Luhui ^{[2
]}

Cui, Jianzhong ^{[3
]}

Yang, Jing ^{[1
]}

Wang, Risheng ^{[1
]}

机构：

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

[2] Shaanxi Normal Univ, Coll Life Sci, Xian 710119, Peoples R China

[3] Huainan Union Univ, Dept Comp, Huainan 232001, Anhui, Peoples R China

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

来源：

ACS SYNTHETIC BIOLOGY | 2021年 / 10卷 / 09期

基金：

中国国家自然科学基金;

关键词：

DNA computing; chemical reaction networks; DNA strand displacement; 0-1 integer programming problem; ANALOG COMPUTATION; CIRCUITS; DESIGN;

D O I：

10.1021/acssynbio.1c00244

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

Chemical reaction networks (CRNs) based on DNA strand displacement (DSD) can be used as an effective programming language for solving various mathematical problems. In this paper, we design three chemical reaction modules by using the DNA strand displacement reaction as the basic principle, with a weighted reaction module, sum reaction module, and threshold reaction module. These modules are used as basic elements to form chemical reaction networks that can be used to solve 0-1 integer programming problems. The problem can be solved through the three steps of weighting, sum, and threshold, and then the results of the operations can be expressed through a single-stranded DNA output with fluorescent molecules. Finally, we use biochemical experiments and Visual DSD simulation software to verify and evaluate the chemical reaction networks. The results have shown that the DSD-based chemical reaction networks constructed in this paper have good feasibility and stability.

引用

页码：2318 / 2330

页数：13

共 50 条

[21] DNA computation model to solve 0-1 programming problem
Zhang, FY
Yin, ZX
Liu, B
Xu, J
BIOSYSTEMS, 2004, 74 (1-3) : 9 - 14
[22] EQUIVALENCE OF THE 0-1 INTEGER PROGRAMMING PROBLEM TO DISCRETE GENERALIZED AND PURE NETWORKS
GLOVER, F
MULVEY, JM
OPERATIONS RESEARCH, 1980, 28 (03) : 829 - 836
[23] An improved integer linear programming formulation for the closest 0-1 string problem
Arbib, Claudio
Servilio, Mara
Ventura, Paolo
COMPUTERS & OPERATIONS RESEARCH, 2017, 80 : 94 - 100
[24] DNA computation for a category-of 0-1 programming problem
Guo, Ping
Yu, HaiFeng
2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 4, 2008, : 40 - 43
[25] DNA computation model to solve 0-1 programming problem
Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
不详
Jisuanji Xuebao, 2008, 12 (2155-2159):
[26] Solving large-scale 0-1 integer programming models with tabu search
Hanafi, S
Amrani, F
Freville, A
FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 32 - 39
[27] 0-1 Programming Problem Based on Sticker Model
Zhi, Lingying
Yin, Zhi-xiang
2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, : 88 - 92
[28] A dynamic attribute reduction algorithm based on 0-1 integer programming
Xu, Yitian
Wang, Laisheng
Zhang, Ruiyan
KNOWLEDGE-BASED SYSTEMS, 2011, 24 (08) : 1341 - 1347
[29] A simplex-based algorithm for 0-1 mixed integer programming
Richard, JPP
de Farias, IR
Nemhauser, GL
COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS, 2003, 2570 : 158 - 170
[30] Solving 0-1 Planning Problem Based on Self-Assembly of DNA Tiles
Huang, Yufang
Cheng, Zhen
Xu, Jin
Shi, Xiaolong
Zhou, Kang
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2010, 7 (05) : 826 - 830

← 1 2 3 4 5 →