A DNA Computing System of Modular-Multiplication over Finite Field GF(2n)

2013 ◽  
pp. 301-311 ◽  
Author(s):  
Yongnan Li ◽  
Limin Xiao ◽  
Li Ruan ◽  
Zhenzhong Zhang ◽  
Deguo Li
Keyword(s):  
Finite Field ◽  
Dna Computing ◽  
Computing System ◽  
Modular Multiplication

A hyper-step DNA computing system based on surface plasmon resonance

2007 ◽  
Author(s):  
Tsung-Yao Chang ◽  
Che-Hsin Lin ◽  
Chia-Ning Yang ◽  
Chii-Wann Lin
Keyword(s):  
Surface Plasmon Resonance ◽  
Surface Plasmon ◽  
Plasmon Resonance ◽  
Dna Computing ◽  
Computing System

Binary Tree DNA Computing Model Based on the Insert - Remove System

2013 ◽  
Vol 411-414 ◽  
pp. 2062-2066
Author(s):  
Qing Hu Wang ◽  
Zhi Li Pei ◽  
Jie Lian ◽  
Bin Wu
Keyword(s):  
Turing Machine ◽  
Binary Tree ◽  
Dna Computing ◽  
Computing System ◽  
Automata Theory ◽  
Dna Molecule ◽  
Computing Model ◽  
Model Based ◽  
Continuous Sequence

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.

scholarly journals 2P471 A liposome containing an autonomous DNA computing system inside(50. Non-equilibrium and complex system,Poster Session,Abstract,Meeting Program of EABS & BSJ 2006)

2006 ◽  
Vol 46 (supplement2) ◽  
pp. S413
Author(s):  
Koh-ichiroh Shohda ◽  
Daisuke Kiga ◽  
Masahiro Takinoue ◽  
Yoshiyuki Kageyama ◽  
Tadashi Sugawara ◽  
...  
Keyword(s):  
Complex System ◽  
Dna Computing ◽  
Poster Session ◽  
Computing System ◽  
Meeting Program ◽  
Non Equilibrium

scholarly journals DNA Matrix Operation Based on the Mechanism of the DNAzyme Binding to Auxiliary Strands to Cleave the Substrate

Biomolecules ◽  
2021 ◽  
Vol 11 (12) ◽  
pp. 1797
Author(s):  
Shaoxia Xu ◽  
Yuan Liu ◽  
Shihua Zhou ◽  
Qiang Zhang ◽  
Nikola K. Kasabov
Keyword(s):  
Numerical Computation ◽  
Dna Computing ◽  
Computing System ◽  
Matrix Operation ◽  
Computing Systems ◽  
Multiplication Operation ◽  
Matrix Operations ◽  
The Matrix ◽  
Speed And Accuracy ◽  
Binding Substrate

Numerical computation is a focus of DNA computing, and matrix operations are among the most basic and frequently used operations in numerical computation. As an important computing tool, matrix operations are often used to deal with intensive computing tasks. During calculation, the speed and accuracy of matrix operations directly affect the performance of the entire computing system. Therefore, it is important to find a way to perform matrix calculations that can ensure the speed of calculations and improve the accuracy. This paper proposes a DNA matrix operation method based on the mechanism of the DNAzyme binding to auxiliary strands to cleave the substrate. In this mechanism, the DNAzyme binding substrate requires the connection of two auxiliary strands. Without any of the two auxiliary strands, the DNAzyme does not cleave the substrate. Based on this mechanism, the multiplication operation of two matrices is realized; the two types of auxiliary strands are used as elements of the two matrices, to participate in the operation, and then are combined with the DNAzyme to cut the substrate and output the result of the matrix operation. This research provides a new method of matrix operations and provides ideas for more complex computing systems.

Better logic for DNA computing

2019 ◽  
Author(s):  
Andrew Scott
Keyword(s):  
Dna Computing
Sign in / Sign up

Export Citation Format

Share Document