A Molecular Computing Model for 0-1 Programming Problem Using DNA Nanoparticles

Yang, Jing; Zhang, Cheng; Shi, Liu; Xia, Hong Gang; Xu, Jin

doi:10.1166/jctn.2013.3218

Cited by 4 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inspired by the idea Adleman, Lipton constructs a network graph G, maps solution space of the satisfiability problem (SAT) to all Hamiltonian paths of the starting and ending points of network graph G, and successfully solves a SAT problem [2]. Later, scholars have continuously innovated on the basis of previous studies and successfully solved the 0-1 integer programming problem [3][4][5][6][7][8], the maximum clique [9], and other complete NP problems [10,11].…”

Section: Introductionmentioning

confidence: 99%

Visual Construction of Logical AND and NAND Gates

Wang

Yin

Zhen

et al. 2022

Journal of Chemistry

Self Cite

View full text Add to dashboard Cite

DNA logic gates are an important branch of DNA computing and have a wide range of applications in DNA computing. In this study, logic circuits of AND gate and NAND gate are built on origami substrate. The realization of AND gate uses polymerase strand displacement (PSD) reaction and hybridization chain reaction (HCR). If there is a fluorescent band “1” displayed, the result is true. The realization of the NAND gate requires a cyclic reaction. If there is a fluorescent band “A” or “T” displayed, the result is true; if no fluorescent band is displayed, the result is false.

show abstract

Section: Introductionmentioning

confidence: 99%

Visual Construction of Logical AND and NAND Gates

Wang

Yin

Zhen

et al. 2022

Journal of Chemistry

Self Cite

View full text Add to dashboard Cite

show abstract

“…0-1 integer programming is a special type of integer programming problem, and its variable values are only 0 and 1. It is widely used in a variety of problems, such as line design, backpack problems, and dispatch problems [13][14][15][16][17]. In 2006, Yin et al designed a molecular beacon model for solving integer linear programming problems [13].…”

Section: Introductionmentioning

confidence: 99%

The Magnetic Bead Computing Model of the 0-1 Integer Programming Problem Based on DNA Cycle Hybridization

Yin

Zhen

et al. 2021

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

Magnetic beads and magnetic Raman technology substrates have good magnetic response ability and surface-enhanced Raman technology (SERS) activity. Therefore, magnetic beads exhibit high sensitivity in SERS detection. In this paper, DNA cycle hybridization and magnetic bead models are combined to solve 0-1 integer programming problems. First, the model maps the variables to DNA strands with hairpin structures and weights them by the number of hairpin DNA strands. This result can be displayed by the specific binding of streptavidin and biotin. Second, the constraint condition of the 0-1 integer programming problem can be accomplished by detecting the signal intensity of the biological barcode to find the optimal solution. Finally, this model can be used to solve the general 0-1 integer programming problem and has more extensive applications than the previous DNA computing model.

show abstract