Some properties of probabilistic one-sided sticker systems
A sticker system, introduced by Kari in 1998, is an abstract computational model that uses the Watson-Crick complementary feature of DNA molecules: starting from the incomplete double stranded sequences and iteratively using sticking operations until a complete double stranded sequence is obtaine...
| Main Authors: | , , , |
|---|---|
| Format: | Proceeding Paper |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/32271/1/50518-ICBioE2013_Pg._502-506.pdf |
| _version_ | 1825647504458252288 |
|---|---|
| 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 |
| collection | IIUM |
| description | A sticker system, introduced by Kari in 1998, is an abstract computational model that uses the
Watson-Crick complementary feature of DNA molecules: starting from the incomplete double
stranded sequences and iteratively using sticking operations until a complete double stranded
sequence is 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. Recently, a variant of restricted sticker
systems, called probabilistic sticker systems, has been introduced. In these models, the probabilities are initially associated with the axioms, and the probability of a generated string is computed by multiplying the probabilities of all occurrences of the initial strings in the computation of the string. In this paper, some properties of probabilistic one-sided sticker systems are investigated. We prove that the probability restriction can increase the computational power of one-sided sticker systems. |
| first_indexed | 2024-03-05T23:18:34Z |
| format | Proceeding Paper |
| id | oai:generic.eprints.org:32271 |
| institution | International Islamic University Malaysia |
| language | English |
| last_indexed | 2024-03-05T23:18:34Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | oai:generic.eprints.org:322712016-05-12T00:23:41Z http://irep.iium.edu.my/32271/ Some properties of probabilistic one-sided sticker systems Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science A sticker system, introduced by Kari in 1998, is an abstract computational model that uses the Watson-Crick complementary feature of DNA molecules: starting from the incomplete double stranded sequences and iteratively using sticking operations until a complete double stranded sequence is 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. Recently, a variant of restricted sticker systems, called probabilistic sticker systems, has been introduced. In these models, the probabilities are initially associated with the axioms, and the probability of a generated string is computed by multiplying the probabilities of all occurrences of the initial strings in the computation of the string. In this paper, some properties of probabilistic one-sided sticker systems are investigated. We prove that the probability restriction can increase the computational power of one-sided sticker systems. 2013 Proceeding Paper PeerReviewed application/pdf en http://irep.iium.edu.my/32271/1/50518-ICBioE2013_Pg._502-506.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Some properties of probabilistic one-sided sticker systems. In: International Conference on Biotechnology Engineering (ICBioE 2013), 2 – 4 Jul 2013, Kuala Lumpur, Malaysia. |
| spellingShingle | QA Mathematics QA75 Electronic computers. Computer science Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Some properties of probabilistic one-sided sticker systems |
| title | Some properties of probabilistic one-sided sticker systems |
| title_full | Some properties of probabilistic one-sided sticker systems |
| title_fullStr | Some properties of probabilistic one-sided sticker systems |
| title_full_unstemmed | Some properties of probabilistic one-sided sticker systems |
| title_short | Some properties of probabilistic one-sided sticker systems |
| title_sort | some properties of probabilistic one sided sticker systems |
| topic | QA Mathematics QA75 Electronic computers. Computer science |
| url | http://irep.iium.edu.my/32271/1/50518-ICBioE2013_Pg._502-506.pdf |
| work_keys_str_mv | AT selvarajoomathuri somepropertiesofprobabilisticonesidedstickersystems AT fongwanheng somepropertiesofprobabilisticonesidedstickersystems AT sarminnorhaniza somepropertiesofprobabilisticonesidedstickersystems AT turaevsherzod somepropertiesofprobabilisticonesidedstickersystems |