Exploiting the Features of the Finite State Automata for Biomolecular Computing

Israel   Marck   Martinez-Perez; Zoya      Ignatova; Karl-Heinz      Zimmermann

Abstract

Here, we review patents that have emerged in the field of DNA-based computing focusing thereby on the discoveries using the concept of molecular finite state automata. A finite state automaton, operating on a finite sequence of symbols and converting information from one to another, provides a basis for developing molecular-scale autonomous programmable models of biomolecular computation at cellular level. We also provide a brief overview on inventions which methodologically support the DNA-based computational approach.

Keywords: DNA computing, biomolecular computing, molecular markers, finite state automata, turing machines, selfassembly, molecular diagnosis, therapy of cancer