Probabilistic sticker systems

• Main Authors: Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
• Format: Article
• Language: English
• Published: Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2013
• Subjects: QA Mathematics; QA75 Electronic computers. Computer science
• Online Access: http://irep.iium.edu.my/32269/1/50515-MJFAS_2013_9%283%29_pg.150-155_389-1516-2-PB.pdf; http://irep.iium.edu.my/32269/; http://mjfas.ibnusina.utm.my/index.php/jfs/article/view/389
• Institution: Universiti Islam Antarabangsa Malaysia

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.