Exploiting the Features of the Finite State Automata for Biomolecular Computing

Author(s): Israel Marck Martinez-Perez, Zoya Ignatova, Karl-Heinz Zimmermann.

Journal Name:Recent Patents on DNA & Gene Sequences (DIscontinued)

Volume 3 , Issue 2 , 2009


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

Rights & PermissionsPrintExport

Article Details

Year: 2009
Page: [130 - 138]
Pages: 9
DOI: 10.2174/187221509788654142
Price: $100