Staff View: Computational power of probabilistic bidirectional sticker system in DNA computing

Computational power of probabilistic bidirectional sticker system in DNA computing

Sticker system has been introduced in 1994 as a model for DNA computing using the re-combination behaviour of DNA molecules. A sticker model is an abstract computational model which uses the Watson-Crick complementarity principle of DNA molecules. Starting from the incomplete double-stranded sequenc...

Full description

Saved in:

Bibliographic Details
Main Authors:	Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Article
Language:	English
Published:	CESER Publications 2015
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/44571/1/44571.pdf http://irep.iium.edu.my/44571/
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.iium.irep.44571
record_format	dspace
spelling	my.iium.irep.445712017-11-07T07:31:33Z http://irep.iium.edu.my/44571/ Computational power of probabilistic bidirectional sticker system in DNA computing Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science Sticker system has been introduced in 1994 as a model for DNA computing using the re-combination behaviour of DNA molecules. A sticker model is an abstract computational model which uses the Watson-Crick complementarity principle of DNA molecules. Starting from the incomplete double-stranded sequences, and by iterative 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 a special type of sticker system known as bidirectional sticker system, the sticking operation occurs at both left and right hand side of the axioms simultaneously. Recently, probabilistic sticker systems have been introduced where the probabilities are initially associated with the axioms or strings, and the probability of the generated string is computed by multiplying the probabilities of all occurrences of the initial strings. In this paper, some properties of probabilistic bidirectional sticker system are investigated. We prove that probabilistic bidirectional sticker system can also increase the computational power of the languages generated. CESER Publications 2015 Article REM application/pdf en http://irep.iium.edu.my/44571/1/44571.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2015) Computational power of probabilistic bidirectional sticker system in DNA computing. International Journal of Applied Mathematics and Statistics, 53 (3). pp. 66-72. ISSN 0973-7545 (O), 0973-1377 (P)
institution	Universiti Islam Antarabangsa Malaysia
building	IIUM Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	International Islamic University Malaysia
content_source	IIUM Repository (IREP)
url_provider	http://irep.iium.edu.my/
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 Computational power of probabilistic bidirectional sticker system in DNA computing
description	Sticker system has been introduced in 1994 as a model for DNA computing using the re-combination behaviour of DNA molecules. A sticker model is an abstract computational model which uses the Watson-Crick complementarity principle of DNA molecules. Starting from the incomplete double-stranded sequences, and by iterative 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 a special type of sticker system known as bidirectional sticker system, the sticking operation occurs at both left and right hand side of the axioms simultaneously. Recently, probabilistic sticker systems have been introduced where the probabilities are initially associated with the axioms or strings, and the probability of the generated string is computed by multiplying the probabilities of all occurrences of the initial strings. In this paper, some properties of probabilistic bidirectional sticker system are investigated. We prove that probabilistic bidirectional sticker system can also increase the computational power of the languages generated.
format	Article
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	Computational power of probabilistic bidirectional sticker system in DNA computing
title_short	Computational power of probabilistic bidirectional sticker system in DNA computing
title_full	Computational power of probabilistic bidirectional sticker system in DNA computing
title_fullStr	Computational power of probabilistic bidirectional sticker system in DNA computing
title_full_unstemmed	Computational power of probabilistic bidirectional sticker system in DNA computing
title_sort	computational power of probabilistic bidirectional sticker system in dna computing
publisher	CESER Publications
publishDate	2015
url	http://irep.iium.edu.my/44571/1/44571.pdf http://irep.iium.edu.my/44571/
_version_	1643612598634020864
score	13.211869

Computational power of probabilistic bidirectional sticker system in DNA computing

Similar Items