DNA Computing Models and Practice

2009 ◽  
Author(s):  
Osamu Ono
Keyword(s):  
Dna Computing ◽  
Computing Models

DNA Computing

2010 ◽  
Vol 2 (4) ◽  
pp. 12-37
Author(s):  
Tao Song ◽  
Xun Wang ◽  
Shudong Wang ◽  
Yun Jiang
Keyword(s):  
Dna Computing ◽  
Medical Science ◽  
Theoretical Framework ◽  
Biomolecular Computing ◽  
Dna Encoding ◽  
Research Directions ◽  
Hamilton Path ◽  
Complete Problems ◽  
Intractable Problems ◽  
Computing Models

DNA computing is widely accepted as a new computing framework all over the world. In this chapter, the background of DNA computing is firstly introduced by solving a Hamilton Path problem. Then three research directions are proposed according to the current development of it, including the theoretical framework, practical DNA computing models and DNA encoding. In each part of the three research directions, many recent results are involved. In the theoretical framework, DNA computing is proved to be computationally universal by four formal DNA computing models. In practical DNA computing models, DNA computing is shown to solve NP-complete problems and work well in other fields, such as medical science. In DNA encoding, some DNA codes and encoding methods are introduced to avoid the false positive phenomenon. And they have a final purpose in common: constructing a universal Biomolecular computing model, which is also called as biomolecular computer, to solve intractable problems for electrical computers. Finally, some further research directions are shown in each part for the design of biomolecular computer.

A Review on DNA Computing Models

2007 ◽  
Vol 4 (7) ◽  
pp. 1219-1230 ◽  
Author(s):  
Jin Xu ◽  
Gangjun Tan
Keyword(s):  
Dna Computing ◽  
Computing Models

scholarly journals DNA Computing: Models and Implementations

2002 ◽  
Vol 7 (3) ◽  
pp. 177-198 ◽  
Author(s):  
Mark J. Daley ◽  
Lila Kari
Keyword(s):  
Dna Computing ◽  
Computing Models

Plasmid Resolving the Satisfiability Problem with DNA Computing Models

2007 ◽  
Vol 4 (7) ◽  
pp. 1243-1248
Author(s):  
Zhi-Xiang Yin ◽  
Jian-Zhong Cui ◽  
Wenbin Liu ◽  
Xiao-Hong Shi ◽  
Jin Xu
Keyword(s):  
Dna Computing ◽  
Satisfiability Problem ◽  
Computing Models

Reversible Computing: An Introduction

2019 ◽  
Author(s):  
Federica Eftimiadi ◽  
Enrico Pugni Trimigliozzi
Keyword(s):  
Laws Of Nature ◽  
Physical Property ◽  
Computing Systems ◽  
Reversible Computing ◽  
Physical Laws ◽  
Structural Aspects ◽  
Computing Models

Reversible computing is a paradigm where computing models are defined so that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. Also, it is one of the basic microscopic physical laws of nature. Reversible computing refers tothe computation that could always be reversed to recover its earlier state. It is based on reversible physics, which implies that we can never truly erase information in a computer. Reversible computing is very difficult and its engineering hurdles are enormous. This paper provides a brief introduction to reversible computing. With these constraints, one can still satisfactorily deal with both functional and structural aspects of computing processes; at the same time, one attains a closer correspondence between the behavior of abstract computing systems and the microscopic physical laws (which are presumed to be strictly reversible) that underlay any implementation of such systems Available online at https://int-scientific-journals.com

A New Method to Optimize the Template Set in DNA Computing

2011 ◽  
Vol 30 (5) ◽  
pp. 1131-1135
Author(s):  
Wen-bing Liu ◽  
Xiang-ou Zhu ◽  
Wiang-hong Wang ◽  
Qiang Zhang ◽  
Run-nian Ma
Keyword(s):  
Dna Computing ◽  
New Method
Sign in / Sign up

Export Citation Format

Share Document