A Computing Model for Four-Valued Logic AND Gate Based on DNA Origami and DNA Displacement

2019 ◽  
pp. 81-90
Author(s):  
Zhen Tang ◽  
Zhixiang Yin ◽  
Xia Sun ◽  
Jing Yang ◽  
Jianzhong Cui
Keyword(s):  
Dna Origami ◽  
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.

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.

Recent Developments of New DNA Origami Nanostructures for Drug Delivery

2015 ◽  
Vol 21 (22) ◽  
pp. 3181-3190 ◽  
Author(s):  
Juan Yan ◽  
Chongya Hu ◽  
Xunwei Liu ◽  
Jian Zhong ◽  
Gang Sun ◽  
...  
Keyword(s):  
Drug Delivery ◽  
Dna Origami ◽  
Recent Developments

Urban Railway Bridge Fast Evaluation Based on Cloud Computing

2011 ◽  
Vol 71-78 ◽  
pp. 4501-4505
Author(s):  
Ming Chen ◽  
Wan Zhou
Keyword(s):  
Neural Networks ◽  
Cloud Computing ◽  
Model Updating ◽  
Condition Assessment ◽  
Fe Model ◽  
Railway Bridge ◽  
Fast Evaluation ◽  
Railway Bridges ◽  
Computing Model ◽  
Bridge Condition Assessment

Although modern bridge are carefully designed and well constructed, damage may occur in them due to unexpected causes. Currently, many different techniques have been proposed and investigated in bridge condition assessment. However, evaluation efficiency of condition assessment has not been paid much attention by the researchers. A fast evaluation of the urban railway bridge condition based on the cloud computing is presented. In this paper dynamic FE model and Artificial neural networks technique is applied to model updating. The cloud computing model provides the basis for fast analyses. It was found that when applied to the actually railway bridges, the proposed method provided results similar to those obtained by experts, but can improve efficiency of bridge

Sign in / Sign up

Export Citation Format

Share Document