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.
KeywordsDNA computing Splicing Formal languages Observer
The authors want to thank Peter R. Cook for providing extremely useful references. P. Leupold has been supported by the FPU grant of the Spanish Ministry of Science and Education. N. Jonoska has been supported in part by NSF Grants CCF #0432009 and CCF #0523928. The paper is based on the work presented at the 11th International Meeting on DNA Based Computers held in London, Canada, June 2005.
- Alhazov A, Cavaliere M (2005) Computing by observing bio-systems: the case of Sticker systems. In: Ferretti C, Mauri G, Zandron C (eds) Proceedings of DNA 10—tenth international meeting on DNA computing. Lecture Notes in Computer Science, 3384, Springer, pp 1–13Google Scholar
- Cavaliere M, Jonoska N (2004) Computing by observing splicing systems. ManuscriptGoogle Scholar
- Cavaliere M, Leupold P (2004a) Evolution and observation—a new way to look at membrane systems. In: Martín-Vide C, Mauri G, Păun Gh, Rozenberg G, Salomaa A (eds) Membrane computing. Lecture Notes in Computer Science, 2933, Springer, pp 70–88Google Scholar
- Cavaliere M, Frisco P, Hoogeboom HJ (2006) Computing by only observing. In: Proceedings tenth international conference on developments in language theory, DLT06. Lecture Notes in Computer Science, 4036, Springer, pp 304–314Google Scholar
- Goode E, Pixton D (2001) Semi-simple splicing systems. In: Martin-Víde C, Mitrana V (eds) Where mathematics, computer science, linguistics and biology meet. Kluwer Academic Publisher, pp 343–352Google Scholar
- Rigler R, Elson ES (2001) Fluorescent correlation spectroscopy. Springer, New YorkGoogle Scholar
- Rozenberg G, Salomaa A (1996) Watson-Crick complementarity, universal computations and genetic engineering. Technical Report 96-28, Department of Computer Science, Leiden UniversityGoogle Scholar