Martinez-Perez Israel M, Zimmermann Karl-Heinz, Ignatova Zoya
Institute of Computer Technology, Hamburg University of Technology, Hamburg 21073, Germany.
Int J Bioinform Res Appl. 2009;5(1):81-96. doi: 10.1504/IJBRA.2009.022465.
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.
在本文中,我们介绍了一种用于有限状态自动机的自主DNA模型。这种被称为贴纸自动机模型的模型基于编码转移规则和输入数据的单链DNA分子(贴纸)的杂交。计算由一种酶以自主方式进行,这使我们能够确定所得的双链DNA分子是否属于自动机的语言。