Cover Image

The properties of probabilistic simple regular sticker system

A mathematical model for DNA computing using the recombination behavior of DNA molecules, known as a sticker system, has been introduced in 1998. In sticker system, the sticker operation is based on the Watson-Crick complementary feature of DNA molecules. The computation of sticker system starts fro...

Full description

Saved in:
Bibliographic Details
Main Authors: Selvarajoo, Mathuri, Wan, Heng Fong, Sarmin, Nor Haniza, Turaev, Sherzod
Format: Article
Language:English
English
Published: American Institute of Physics 2015
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://irep.iium.edu.my/47357/1/SKSM22_24-26_Nov_2014_AIP_Conf_Proc_1682_%282015%29_-_Mathuri_002047_1-9.pdf
http://irep.iium.edu.my/47357/4/47357_The%20properties%20of%20probabilistic%20simple%20regular_Scopus.pdf
http://irep.iium.edu.my/47357/
http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.4932456
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.iium.irep.47357
record_format dspace
spelling my.iium.irep.473572017-09-23T07:34:54Z http://irep.iium.edu.my/47357/ The properties of probabilistic simple regular sticker system Selvarajoo, Mathuri Wan, Heng Fong Sarmin, Nor Haniza Turaev, Sherzod QA75 Electronic computers. Computer science A mathematical model for DNA computing using the recombination behavior of DNA molecules, known as a sticker system, has been introduced in 1998. In sticker system, the sticker operation is based on the Watson-Crick complementary feature of DNA molecules. The computation of sticker system starts from an incomplete double-stranded sequence. Then by iterative sticking operations, a complete double-stranded sequence is obtained. It is known that sticker systems with finite sets of axioms and sticker rule (including the simple regular sticker system) generate only regular languages. Hence, different types of restrictions have been considered to increase the computational power of the languages generated by the sticker systems. In this paper, we study the properties of probabilistic simple regular sticker systems. In this variant of sticker system, probabilities are associated with the axioms, and the probability of a generated string is computed by multiplying the probabilities of all occurrences of the initial strings. The language are selected according to some probabilistic requirements. We prove that the probabilistic enhancement increases the computational power of simple regular sticker systems. American Institute of Physics 2015 Article REM application/pdf en http://irep.iium.edu.my/47357/1/SKSM22_24-26_Nov_2014_AIP_Conf_Proc_1682_%282015%29_-_Mathuri_002047_1-9.pdf application/pdf en http://irep.iium.edu.my/47357/4/47357_The%20properties%20of%20probabilistic%20simple%20regular_Scopus.pdf Selvarajoo, Mathuri and Wan, Heng Fong and Sarmin, Nor Haniza and Turaev, Sherzod (2015) The properties of probabilistic simple regular sticker system. AIP Conference Proceedings, 1682. 020047-1. ISSN 0094-243X http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.4932456 10.1063/1.4932456
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
English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Selvarajoo, Mathuri
Wan, Heng Fong
Sarmin, Nor Haniza
Turaev, Sherzod
The properties of probabilistic simple regular sticker system
description A mathematical model for DNA computing using the recombination behavior of DNA molecules, known as a sticker system, has been introduced in 1998. In sticker system, the sticker operation is based on the Watson-Crick complementary feature of DNA molecules. The computation of sticker system starts from an incomplete double-stranded sequence. Then by iterative sticking operations, a complete double-stranded sequence is obtained. It is known that sticker systems with finite sets of axioms and sticker rule (including the simple regular sticker system) generate only regular languages. Hence, different types of restrictions have been considered to increase the computational power of the languages generated by the sticker systems. In this paper, we study the properties of probabilistic simple regular sticker systems. In this variant of sticker system, probabilities are associated with the axioms, and the probability of a generated string is computed by multiplying the probabilities of all occurrences of the initial strings. The language are selected according to some probabilistic requirements. We prove that the probabilistic enhancement increases the computational power of simple regular sticker systems.
format Article
author Selvarajoo, Mathuri
Wan, Heng Fong
Sarmin, Nor Haniza
Turaev, Sherzod
author_facet Selvarajoo, Mathuri
Wan, Heng Fong
Sarmin, Nor Haniza
Turaev, Sherzod
author_sort Selvarajoo, Mathuri
title The properties of probabilistic simple regular sticker system
title_short The properties of probabilistic simple regular sticker system
title_full The properties of probabilistic simple regular sticker system
title_fullStr The properties of probabilistic simple regular sticker system
title_full_unstemmed The properties of probabilistic simple regular sticker system
title_sort properties of probabilistic simple regular sticker system
publisher American Institute of Physics
publishDate 2015
url http://irep.iium.edu.my/47357/1/SKSM22_24-26_Nov_2014_AIP_Conf_Proc_1682_%282015%29_-_Mathuri_002047_1-9.pdf
http://irep.iium.edu.my/47357/4/47357_The%20properties%20of%20probabilistic%20simple%20regular_Scopus.pdf
http://irep.iium.edu.my/47357/
http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.4932456
_version_ 1643613177440632832
score 13.211869

Similar Items