Programmable pushdown store base on DNA computing

Authors:
Zheng Zhang;Jin Xu;Jie Liu;Linqiang Pan
Affiliations:
Department of Control Science and Engineering, Huazhong Univ of Sci&Tech, Wuhan, China;Department of Control Science and Engineering, Huazhong Univ of Sci&Tech, Wuhan, China;Institute of Material Science and Engineering, Huazhong Univ of Sci&Tech, Wuhan, China;Department of Control Science and Engineering, Huazhong Univ of Sci&Tech, Wuhan, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Year:
2006

Citing 3
Cited 0

Molecular computation of solutions to combinatorial problems

Science
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Improve capability of DNA automaton: DNA automaton with three internal states and tape head move in two directions

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA computing aims at using nucleic acids for computing. Micro-molar DNA solutions can act as billions of parallel nanoprocessors with few consume. Finite automation is a general compute model. Now, A programmable finite automation based on DNA computing is available[1]. It's act as a basic features and processes of a finite automaton with two internal states and an alphabet comprising two input symbols. Here we describe a new finite automata made of biomolecules, which can be used as a programmable pushdown store.