An autonomous DNA model for finite state automata

Authors:
Israel M. Martinez-Perez;Karl-Heinz Zimmermann;Zoya Ignatova
Affiliations:
Institute of Computer Technology, Hamburg University of Technology, Hamburg 21073, Germany.;Institute of Computer Technology, Hamburg University of Technology, Hamburg 21073, Germany.;Biochemistry University Potsdam, Potsdam 14476, Germany
Venue:
International Journal of Bioinformatics Research and Applications
Year:
2009

Citing 8
Cited 0

A magic pot: self-assembly computation revisited

Formal and natural computing
Biomolecular autonomous solution of the Hamiltonian path problem via hairpin formation

International Journal of Bioinformatics Research and Applications
Intensive in vitro experiments of implementing and executing finite automata in test tube

DNA'05 Proceedings of the 11th international conference on DNA Computing
Development of an in vivo computer based on escherichia coli

DNA'05 Proceedings of the 11th international conference on DNA Computing
Chain reaction systems based on loop dissociation of DNA

DNA'05 Proceedings of the 11th international conference on DNA Computing
In search of optimal codes for DNA computing

DNA'06 Proceedings of the 12th international conference on DNA Computing
A framework for modeling DNA based molecular systems

DNA'06 Proceedings of the 12th international conference on DNA Computing
Design of an autonomous DNA nanomechanical device capable of universal computation and universal translational motion

DNA'04 Proceedings of the 10th international conference on DNA computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce an autonomous DNA model for finite state automata. This model called sticker automaton model is based on the hybridisation of single stranded DNA molecules (stickers) encoding transition rules and input data. The computation is carried out in an autonomous manner by one enzyme which allows us to determine whether a resulting double-stranded DNA molecule belongs to the automaton's language or not.