Probabilistic simple sticker systems

A model for DNA computing using the recombination behavior of DNA molecules, known as a sticker system, was introduced by by L. Kari, G. Paun, G. Rozenberg, A. Salomaa, and S. Yu in the paper entitled DNA computing, sticker systems and universality from the journal of Acta Informatica vol. 35, pp. 4...

Full description

Bibliographic Details
Main Authors:	Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Conference or Workshop Item
Language:	English English English
Published:	American Institute of Physics 2017
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/58703/ http://irep.iium.edu.my/58703/ http://irep.iium.edu.my/58703/ http://irep.iium.edu.my/58703/1/58703_Probabilistic%20Simple%20Sticker%20Systems.pdf http://irep.iium.edu.my/58703/2/58703_Probabilistic%20Simple%20Sticker%20Systems_SCOPUS.pdf http://irep.iium.edu.my/58703/13/58703%20Probabilistic%20simple%20sticker%20systems%20WOS.pdf

id	iium-58703
recordtype	eprints
spelling	iium-587032019-08-18T07:24:52Z http://irep.iium.edu.my/58703/ Probabilistic simple 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, was introduced by by L. Kari, G. Paun, G. Rozenberg, A. Salomaa, and S. Yu in the paper entitled DNA computing, sticker systems and universality from the journal of Acta Informatica vol. 35, pp. 401-420 in the year 1998. A sticker system 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 [4]. In this variant, 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. Strings for the language are selected according to some probabilistic requirements. In this paper, we study fundamental properties of probabilistic simple sticker systems. We prove that the probabilistic enhancement increases the computational power of simple sticker systems. American Institute of Physics 2017 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/58703/1/58703_Probabilistic%20Simple%20Sticker%20Systems.pdf application/pdf en http://irep.iium.edu.my/58703/2/58703_Probabilistic%20Simple%20Sticker%20Systems_SCOPUS.pdf application/pdf en http://irep.iium.edu.my/58703/13/58703%20Probabilistic%20simple%20sticker%20systems%20WOS.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2017) Probabilistic simple sticker systems. In: 4th International Conference on Mathematical Sciences (ICMS 2016), 15th-17th November 2016, Palm Garden Hotel, IOI Resort, Putrajaya, Malaysia. http://dx.doi.org/10.1063/1.4980920 10.1063/1.4980920
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English English
topic	QA Mathematics QA75 Electronic computers. Computer science
spellingShingle	QA Mathematics QA75 Electronic computers. Computer science Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Probabilistic simple sticker systems
description	A model for DNA computing using the recombination behavior of DNA molecules, known as a sticker system, was introduced by by L. Kari, G. Paun, G. Rozenberg, A. Salomaa, and S. Yu in the paper entitled DNA computing, sticker systems and universality from the journal of Acta Informatica vol. 35, pp. 401-420 in the year 1998. A sticker system 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 [4]. In this variant, 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. Strings for the language are selected according to some probabilistic requirements. In this paper, we study fundamental properties of probabilistic simple sticker systems. We prove that the probabilistic enhancement increases the computational power of simple sticker systems.
format	Conference or Workshop Item
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
title	Probabilistic simple sticker systems
title_short	Probabilistic simple sticker systems
title_full	Probabilistic simple sticker systems
title_fullStr	Probabilistic simple sticker systems
title_full_unstemmed	Probabilistic simple sticker systems
title_sort	probabilistic simple sticker systems
publisher	American Institute of Physics
publishDate	2017
url	http://irep.iium.edu.my/58703/ http://irep.iium.edu.my/58703/ http://irep.iium.edu.my/58703/ http://irep.iium.edu.my/58703/1/58703_Probabilistic%20Simple%20Sticker%20Systems.pdf http://irep.iium.edu.my/58703/2/58703_Probabilistic%20Simple%20Sticker%20Systems_SCOPUS.pdf http://irep.iium.edu.my/58703/13/58703%20Probabilistic%20simple%20sticker%20systems%20WOS.pdf
first_indexed	2023-09-18T21:23:02Z
last_indexed	2023-09-18T21:23:02Z
_version_	1777412008695562240

Probabilistic simple sticker systems

Similar Items