Probabilistic sticker systems

Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Probabilistic sticker systems. Malaysian Journal of Fundamental and Applied Sciences, 9 (3). pp. 150-155. ISSN 1823-626X

PDF - Published Version Restricted to Repository staff only Download (166kB) | Request a copy

Abstract

A model for DNA computing using the recombination behavior 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.

Item Type:	Article (Journal)
Additional Information:	6846/32269
Uncontrolled Keywords:	DNA Computing, Sticker system, Probabilistic, Regular languages, Computational power
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Dr. Sherzod Turaev
Date Deposited:	09 Oct 2013 09:54
Last Modified:	09 Oct 2013 15:28
URI:	http://irep.iium.edu.my/id/eprint/32269

Actions (login required)

View Item