Development of a DNA computing model for Boolean Circuit

Author(s):  
Kuntala Boruah ◽  
Jiten Ch Dutta
2013 ◽  
Vol 411-414 ◽  
pp. 2062-2066
Author(s):  
Qing Hu Wang ◽  
Zhi Li Pei ◽  
Jie Lian ◽  
Bin Wu

DNA computing has the support of automata theory completely, based on the equivalent for expressing problem by DNA computing model and the double-shift language in automata theory, using a DNA molecule may encode the instantaneous description of Turing machine, and the operation of continuous sequence can be realized by the DNA molecule s operation with enzymes. Insert - Remove System is a computing system in DNA computing, designed an Binary Tree DNA computing model based on the Insert - Remove System in this paper, which can realize the insert, delete and traversal operation, and has the completeness of the theory.


Engineering ◽  
2018 ◽  
Vol 4 (1) ◽  
pp. 61-77 ◽  
Author(s):  
Jin Xu ◽  
Xiaoli Qiang ◽  
Kai Zhang ◽  
Cheng Zhang ◽  
Jing Yang

2007 ◽  
Vol 17 (6) ◽  
pp. 708-711 ◽  
Author(s):  
Fang Gang ◽  
Zhang Shemin ◽  
Dong Yafei ◽  
Xu Jin

2020 ◽  
Vol 15 (11) ◽  
pp. 1327-1334
Author(s):  
Chun Huang ◽  
Ying-Jie Han ◽  
Jun-Wei Sun ◽  
Wei-Jun Zhu ◽  
Yan-Feng Wang ◽  
...  

DNA algorithmic self-assembly plays a vital role in DNA computing, which is applied to create new DNA tiles and then guides these tiles into an algorithmic lattice. However, the larger the logical calculation scale is, the more tile sets will be needed, so that computing model design and experiment will be increasingly difficult. This paper presents a new DNA ‘3-arm sub-tile strategy’ that constructs XOR and half-adder logical circuits. The types of DNA tile corresponding to the logical values is unified in DNA XOR and half-adder logical circuits, which have only three kinds of DNA tiles: logic ‘0’, logic ‘1’ and fixation tile. Compared with the previous references, the amount of DNA tile types has been greatly reduced. Moreover, the half-adder molecular circuit has a distinctive feature, which is an application of the expansion of the XOR logic circuit. Meanwhile, a set of DNA 3-arm sub-tiles suitable for half-adder logical computation is designed on the NUPACK online server. The simulated experiments show that the correct rate of base pairing of the designed DNA encoding is high and the structures are stable. The DNA 3-arm sub-tile self-assembly methods provide a new way to form DNA logical circuits, and has a great potential in the expansion of the integrated circuits.


Author(s):  
Zhixiang Yin ◽  
Jing Yang ◽  
Qiang Zhang ◽  
Zhen Tang ◽  
Guoqiang Wang ◽  
...  

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.


Sign in / Sign up

Export Citation Format

Share Document