Cover Image

Some characteristics of probabilistic one-sided splicing systems

A theoretical model for DNA computing using the recombination behavior of DNA molecules known as asplicing 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 t...

Full description

Saved in:
Bibliographic Details
Main Authors: Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format: Conference or Workshop Item
Published: 2013
Subjects:
Q Science
QA Mathematics
Online Access:http://eprints.utm.my/id/eprint/51312/
http://dx.doi.org/10.1063/1.4801235
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.51312
record_format eprints
spelling my.utm.513122017-09-12T07:10:39Z http://eprints.utm.my/id/eprint/51312/ Some characteristics of probabilistic one-sided splicing systems Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Q Science QA Mathematics A theoretical model for DNA computing using the recombination behavior of DNA molecules known as asplicing 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-04 Conference or Workshop Item PeerReviewed Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Some characteristics of probabilistic one-sided splicing systems. In: Proceedings Of The 20th National Symposium On Mathematical Sciences (SKSM20): Research In Mathematical Sciences: A Catalyst For Creativity And Innovation, PTS A And B, 18 December 2012 through 20 December 2012, Putrajaya; Malaysia. http://dx.doi.org/10.1063/1.4801235
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic Q Science
QA Mathematics
spellingShingle Q Science
QA Mathematics
Selvarajoo, Mathuri
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
Some characteristics of probabilistic one-sided splicing systems
description A theoretical model for DNA computing using the recombination behavior of DNA molecules known as asplicing 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.
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 characteristics of probabilistic one-sided splicing systems
title_short 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_sort some characteristics of probabilistic one-sided splicing systems
publishDate 2013
url http://eprints.utm.my/id/eprint/51312/
http://dx.doi.org/10.1063/1.4801235
_version_ 1643653002621353984
score 13.211869

Similar Items