Exploiting the features of the finite state automata for biomolecular computing.
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.
Martínez-Pérez
Israel Marck
IM
Institute of Computer Technology, Hamburg University of Technology, Germany.
Ignatova
Zoya
Z
Zimmermann
Karl-Heinz
KH
D001331:Automation; D039301:Computers, Molecular; D003205:Computing Methodologies; D004247:DNA / Q000737:chemistry*; D010330:Patents as Topic
D004247:DNA