DNA Origami Based Computing Model for the Satisfiability Problem

2018 ◽  
pp. 151-160
Author(s):  
Zhenqin Yang ◽  
Zhixiang Yin ◽  
Jianzhong Cui ◽  
Jing Yang
Keyword(s):  
Dna Origami ◽  
Satisfiability Problem ◽  
Computing Model

DNA Computing Model for Satisfiability Problem Based on Hybridization Chain Reaction

2020 ◽  
pp. 2159010
Author(s):  
Zhixiang Yin ◽  
Jing Yang ◽  
Qiang Zhang ◽  
Zhen Tang ◽  
Guoqiang Wang ◽  
...  
Keyword(s):  
Dna Computing ◽  
Dna Origami ◽  
Satisfiability Problem ◽  
Hybridization Chain Reaction ◽  
Chain Reaction ◽  
Computing Device ◽  
Computing Model ◽  
Novel Method ◽  
Np Complete ◽  
The Given

Satisfiability problem is a famous nondeterministic polynomial-time complete (NP-complete) problem, which has always been a hotspot in artificial intelligence. In this paper, by combining the advantages of DNA origami with hybridization chain reaction, a computing model was proposed to solve the satisfiability problem. For each clause in the given formula, a DNA origami device was devised. The device corresponding to the clause was capable of searching for assignments that satisfied the clause. When all devices completed the search in parallel, the intersection of these satisfying assignments found must satisfy all the clauses. Therefore, whether the given formula is satisfiable or not was decided. The simulation results demonstrated that the proposed computing model was feasible. Our work showed the capability of DNA origami in architecting automatic computing device. The paper proposed a novel method for designing functional nanoscale devices based on DNA origami.

A Biobrick Inversion Cellular Computing Model for Satisfiability Problem

2014 ◽  
Vol 36 (12) ◽  
pp. 2537-2544 ◽  
Author(s):  
Mei CHEN ◽  
Xiang-Qun CHEN ◽  
Lu ZHANG ◽  
Jin Xu
Keyword(s):  
Satisfiability Problem ◽  
Computing Model ◽  
Cellular Computing

Molecular Beacon Based DNA Computing Model for General Satisfiability Problem

2009 ◽  
Vol 31 (12) ◽  
pp. 2200-2206 ◽  
Author(s):  
Zhi-Xiang YIN ◽  
Jian-Zhong CUI ◽  
Ling-Ying ZHI ◽  
Xia SUN ◽  
Xiao-Hui HUANG
Keyword(s):  
Dna Computing ◽  
Molecular Beacon ◽  
Satisfiability Problem ◽  
Computing Model

Search computing model for the knapsack problem based on DNA origami

2019 ◽  
Vol 9 (6) ◽  
pp. 553-562 ◽  
Author(s):  
Jing Yang ◽  
Zhixiang Yin ◽  
Zhen Tang ◽  
Kaifeng Huang ◽  
Jianzhong Cui ◽  
...  
Keyword(s):  
Combinatorial Optimization ◽  
Knapsack Problem ◽  
Simulation Software ◽  
Dna Origami ◽  
Directed Path ◽  
Chain Reaction ◽  
Detection Techniques ◽  
Complete Problem ◽  
Computing Model ◽  
Np Complete

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.

A SERVICE FOR SOLVING BOOLEAN SATISFIABILITY PROBLEM USING NVIDIA CUDA TECHNOLOGY

2017 ◽  
Vol 4 (56) ◽  
pp. 107-114
Author(s):  
A. D. Kolosov ◽  
◽  
V. O. Gorovoy ◽  
V. V. Kondratiev ◽  
◽  
...  
Keyword(s):  
Boolean Satisfiability ◽  
Satisfiability Problem ◽  
Boolean Satisfiability Problem ◽  
Nvidia Cuda ◽  
Cuda Technology
Sign in / Sign up

Export Citation Format

Share Document