Some characteristics of probabilistic one-sided splicing systems
A theoretical model for DNA computing using the recombination behavior of DNA molecules known as a splicing system has been introduced in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings at the specific places and attaches the prefix of the first string...
| Main Authors: | , , , |
|---|---|
| Format: | Proceeding Paper |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/32264/ http://irep.iium.edu.my/32264/1/50517-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Mathuri%29_967-975.pdf |
| _version_ | 1848780529770430464 |
|---|---|
| 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 theoretical model for DNA computing using the recombination behavior of DNA molecules known as a splicing system has been introduced in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings at the specific places and attaches the prefix of the first string to the suffix of the second string and the prefix of the second string to the suffix of the first string yielding the new strings. It is known that splicing systems with finite sets of axioms and splicing rules only generate regular languages. Hence, different types of restrictions for splicing systems have been considered to increase the computational power of the languages generated. Recently, probabilistic splicing systems have been introduced where the probabilities are initially associated with the axioms, and the probabilities of the generated strings are computed from the probabilities of the initial strings. In this paper, some properties of probabilistic one-sided splicing systems, which are special types of probabilistic splicing systems, are investigated. We prove that probabilistic one-sided splicing systems can also increase the computational power of the languages generated. |
| first_indexed | 2025-11-14T15:35:07Z |
| format | Proceeding Paper |
| id | iium-32264 |
| institution | International Islamic University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T15:35:07Z |
| publishDate | 2013 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | iium-322642016-05-11T09:30:42Z http://irep.iium.edu.my/32264/ Some characteristics of probabilistic one-sided splicing systems Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science A theoretical model for DNA computing using the recombination behavior of DNA molecules known as a splicing system has been introduced in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings at the specific places and attaches the prefix of the first string to the suffix of the second string and the prefix of the second string to the suffix of the first string yielding the new strings. It is known that splicing systems with finite sets of axioms and splicing rules only generate regular languages. Hence, different types of restrictions for splicing systems have been considered to increase the computational power of the languages generated. Recently, probabilistic splicing systems have been introduced where the probabilities are initially associated with the axioms, and the probabilities of the generated strings are computed from the probabilities of the initial strings. In this paper, some properties of probabilistic one-sided splicing systems, which are special types of probabilistic splicing systems, are investigated. We prove that probabilistic one-sided splicing systems can also increase the computational power of the languages generated. 2013 Proceeding Paper PeerReviewed application/pdf en http://irep.iium.edu.my/32264/1/50517-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Mathuri%29_967-975.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Some characteristics of probabilistic one-sided splicing systems. In: 20th National Symposium on Mathematical Sciences, 18–20 December 2012 , Palm Garden Hotel, Putrajaya, Malaysia . http://proceedings.aip.org/resource/2/apcpcs/1522/1/967_1?isAuthorized=no |
| spellingShingle | QA Mathematics QA75 Electronic computers. Computer science Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Some characteristics of probabilistic one-sided splicing systems |
| title | Some characteristics of probabilistic one-sided splicing systems |
| title_full | Some characteristics of probabilistic one-sided splicing systems |
| title_fullStr | Some characteristics of probabilistic one-sided splicing systems |
| title_full_unstemmed | Some characteristics of probabilistic one-sided splicing systems |
| title_short | Some characteristics of probabilistic one-sided splicing systems |
| title_sort | some characteristics of probabilistic one-sided splicing systems |
| topic | QA Mathematics QA75 Electronic computers. Computer science |
| url | http://irep.iium.edu.my/32264/ http://irep.iium.edu.my/32264/ http://irep.iium.edu.my/32264/1/50517-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Mathuri%29_967-975.pdf |