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...

Full description

Bibliographic Details
Main Authors:	Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Conference or Workshop Item
Language:	English
Published:	2013
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/32271/ http://irep.iium.edu.my/32271/1/50518-ICBioE2013_Pg._502-506.pdf

id	iium-32271
recordtype	eprints
spelling	iium-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 Conference or Workshop Item 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.
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	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 Some properties of probabilistic one-sided sticker systems
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.
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	Some properties of probabilistic one-sided sticker systems
title_short	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_sort	some properties of probabilistic one-sided sticker systems
publishDate	2013
url	http://irep.iium.edu.my/32271/ http://irep.iium.edu.my/32271/1/50518-ICBioE2013_Pg._502-506.pdf
first_indexed	2023-09-18T20:46:35Z
last_indexed	2023-09-18T20:46:35Z
_version_	1777409715456704512

Some properties of probabilistic one-sided sticker systems

Similar Items