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

Qing Hu Wang; Zhi Li Pei; Jie Lian; Bin Wu

doi:10.4028/www.scientific.net/AMM.411-414.2062

Paper Titles

3D Object Classification Using a Two-Dimensional Hidden Markov Model
p.2041

Two Systematic Methods for Generating Paths in Twisted Cube Networks
p.2047

Development Research on the Expert System for the Binary Tree-Based Apple Disease Diagnosis
p.2051

A MSTP DNA Computing Model Based on Genetic Algorithm and Incompletion-Molecule Commixed Encoding Strategy
p.2056

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

Multi-Subexpression Programming
p.2067

Prediction Modeling Method of Interval Grey Number Based on Different Type Whitenization Weight Functions
p.2074

The Review of the Single Machine Scheduling Problem and its Solving Methods
p.2081

An Approach Based on Generic Label Correcting Algorithm for Supply Chain Modeling
p.2085

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 411-414Binary Tree DNA Computing Model Based on the...

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

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 411-414)

Pages:

2062-2066

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.411-414.2062

Citation:

Cite this paper

Online since:

September 2013

Authors:

Qing Hu Wang, Zhi Li Pei, Jie Lian, Bin Wu

Keywords:

Binary Tree, DNA Computing, Insert-Remove System

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Adleman Leonard M. Molecular Computation of Solution to Combinatorial Problems [J]. Science, 1994, 66(11): 1021-1024.

Google Scholar

[2] TomHead. Hamilton Paths and Double Stranded DNA Computing with Bio-Molecules: Theory and Experiments[J]. Springer, 1998: 81-92.

Google Scholar

[3] Wang Shudong, Dong Yafei, Jin Xu. Minimum recovering problem based on DNA computing. [J]. Journal of Chemical Information and Computer Seience, 2002, 42(2): 146-150.

Google Scholar