Probabilistic sticker systems
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
2013
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/32269/ http://irep.iium.edu.my/32269/1/50515-MJFAS_2013_9%283%29_pg.150-155_389-1516-2-PB.pdf |
| _version_ | 1848780531139870720 |
|---|---|
| author | Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod |
| author_facet | Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod |
| author_sort | Selvarajoo, Mathuri |
| building | IIUM Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T15:35:09Z |
| format | Article |
| id | iium-32269 |
| institution | International Islamic University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T15:35:09Z |
| publishDate | 2013 |
| publisher | Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | iium-322692013-10-09T07:28:40Z http://irep.iium.edu.my/32269/ Probabilistic sticker systems Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science 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. Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2013 Article PeerReviewed application/pdf en http://irep.iium.edu.my/32269/1/50515-MJFAS_2013_9%283%29_pg.150-155_389-1516-2-PB.pdf 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 http://mjfas.ibnusina.utm.my/index.php/jfs/article/view/389 |
| spellingShingle | QA Mathematics QA75 Electronic computers. Computer science Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Probabilistic sticker systems |
| title | Probabilistic sticker systems |
| title_full | Probabilistic sticker systems |
| title_fullStr | Probabilistic sticker systems |
| title_full_unstemmed | Probabilistic sticker systems |
| title_short | Probabilistic sticker systems |
| title_sort | probabilistic sticker systems |
| topic | QA Mathematics QA75 Electronic computers. Computer science |
| url | http://irep.iium.edu.my/32269/ http://irep.iium.edu.my/32269/ http://irep.iium.edu.my/32269/1/50515-MJFAS_2013_9%283%29_pg.150-155_389-1516-2-PB.pdf |