Motivated by several techniques for observing molecular processes in real-time we introduce a computing device that stresses the role of the observer in biological computations and that is based on the observed behavior of a splicing system. The basic idea is to introduce a marked DNA strand into a test tube with other DNA strands and restriction enzymes. Under the action of these enzymes the DNA starts to splice. An external observer monitors and registers the evolution of the marked DNA strand. The input marked DNA strand is then accepted if its observed evolution follows a certain expected pattern. We prove that using simple observers (finite automata), applied on finite splicing systems (finite set of rules and finite set of axioms), the class of recursively enumerable languages can be recognized. © Springer Science+Business Media B.V. 2007.
DNA splicing: Computing by observing / Cavaliere, M.; Jonoska, N.; Leupold, P.. - In: NATURAL COMPUTING. - ISSN 1567-7818. - 8:1(2009), pp. 157-170. [10.1007/s11047-007-9062-8]