Probabilistic sticker systems
Keywords:DNA Computing, Sticker system, Probabilistic, Regular languages, Computationalpower,
AbstractA model for DNA computing using the recombination behaviour of DNA molecules known as a sticker system has been introduced by Adleman in 1994. A sticker model is an abstract computational model which uses the Watson-Crick complementary principle of DNA molecules. Starting from the axioms – incomplete double stranded sequences, and iteratively using sticking operations, complete double stranded sequences are obtained. It is known that sticker systems with finite sets of axioms and sticker rules generate only regular languages. Hence, different types of restrictions have been considered to increase the computational power of sticker systems. In this paper, we introduce probabilistic sticker systems in which probabilities are initially associated with the axioms, and the probability of the generated string is computed by multiplying the probabilities of all occurrences of the initial strings used in the computation of the string.
L.M. Adleman, Science, 266 (1994) 1021-1024.
L. Kari, G. Paun, G. Rozenberg, A. Salomaa, and S. Yu, ActaInformatica, 35 (1998) 401-420.
L. Kari, S. Seki, and P. Sosik, DNA Computing: Foundations and Implications for Computer Science, Springer-Verlag, Berlin, 2010.
R. Freund, G. Paun, G. Rozenberg, and A. Salomaa, Pacific Symposium on Biocomputing, (1998) 535-546.
G. Paun, and G. Rozenberg, Theoretical Computer Science, 204 (1998) 183-203.
J. Xu, Y. Dong, and X. Wei, Chinese Science Bulletin, 49(8) (2004) 772-780.
G. Rozenberg, G. Paun, and A. Salomaa, DNA Computing: A New Computing Paradigms,Springer-Verlag,New York, 1998.
A. Alhazov, and M. Ferretti, Computing by Observing Bio-Systems: The Case of Sticker Systems, DNA Computing, Springer-Verlag,Italy, 2004, 1-13.
P. Linz, An Introduction to Formal Languages and Automata. 4th Edition,Jones and Bartlett Publishers,United States of America, 2006.