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 条

[31] Solving the 0-1 Planning Problem Based on Self-assembly of DNA Tiles
Huang, Yufang
Cheng, Zhen
Xu, Jin
2008 THIRD INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, 2008, : 63 - +
[32] NETWORK RELAXATIONS FOR 0-1 INTEGER PROGRAMS
MULVEY, J
OPERATIONS RESEARCH, 1975, 23 : B386 - B386
[33] 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
[34] 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
[35] Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
Alain Billionnet
Sourour Elloumi
Mathematical Programming, 2007, 109 : 55 - 68
[36] Some new perspectives for solving 0-1 integer programming problems using Balas method
Glover, J.
Quan, V.
Zolfaghari, S.
COMPUTATIONAL MANAGEMENT SCIENCE, 2021, 18 (02) : 177 - 193
[37] CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM
GLOVER, F
WOOLSEY, E
OPERATIONS RESEARCH, 1974, 22 (01) : 180 - 182
[38] IPplacer: An Efficient 0-1 Integer Programming based Placement for VLSI Circuits
Data, Prasun
Mukherjee, Shyamapada
2018 9TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT), 2018,
[39] Detection of Code Spread OFDM Based on 0-1 Integer Quadratic Programming
Elghariani, Ali
Zoltowski, Michael D.
WIRELESS SENSING, LOCALIZATION, AND PROCESSING VII, 2012, 8404
[40] Detection of Code Spread OFDM Based on 0-1 Integer Quadratic Programming
Elghariani, Ali
Zoltowski, Michael D.
2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2012, : 1962 - 1966

← 1 2 3 4 5 →