Probabilistic simple splicing systems

A splicing system, one of the early theoretical models for DNA computing was introduced by Head in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings of DNA molecules at the specific recognition sites and attaches the prefix of the first string to the suff...

Full description

Bibliographic Details
Main Authors:	Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Article
Language:	English English
Published:	American Institute of Physics 2014
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/37015/ http://irep.iium.edu.my/37015/ http://irep.iium.edu.my/37015/ http://irep.iium.edu.my/37015/1/37015_Probabilistic%20simple%20splicing%20systems.pdf http://irep.iium.edu.my/37015/2/37015_Probabilistic%20simple%20splicing%20systems_SCOPUS.pdf

id	iium-37015
recordtype	eprints
spelling	iium-370152017-09-19T09:16:03Z http://irep.iium.edu.my/37015/ Probabilistic simple splicing systems Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA75 Electronic computers. Computer science A splicing system, one of the early theoretical models for DNA computing was introduced by Head in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings of DNA molecules at the specific recognition sites 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, thus yielding the new strings. For a specific type of splicing systems, namely the simple splicing systems, the recognition sites are the same for both strings of DNA molecules. It is known that splicing systems with finite sets of axioms and splicing rules only generate regular languages. Hence, different types of restrictions have been considered for splicing systems in order to increase their computational power. 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 simple splicing systems are investigated. We prove that probabilistic simple splicing systems can also increase the computational power of the splicing languages generated. American Institute of Physics 2014 Article PeerReviewed application/pdf en http://irep.iium.edu.my/37015/1/37015_Probabilistic%20simple%20splicing%20systems.pdf application/pdf en http://irep.iium.edu.my/37015/2/37015_Probabilistic%20simple%20splicing%20systems_SCOPUS.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2014) Probabilistic simple splicing systems. AIP Conference Proceedings, 1602. pp. 760-766. ISSN 0094-243X E-ISSN 1551-7616 http://scitation.aip.org/content/aip/proceeding/aipcp/1602 10.1063/1.4882571
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Probabilistic simple splicing systems
description	A splicing system, one of the early theoretical models for DNA computing was introduced by Head in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings of DNA molecules at the specific recognition sites 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, thus yielding the new strings. For a specific type of splicing systems, namely the simple splicing systems, the recognition sites are the same for both strings of DNA molecules. It is known that splicing systems with finite sets of axioms and splicing rules only generate regular languages. Hence, different types of restrictions have been considered for splicing systems in order to increase their computational power. 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 simple splicing systems are investigated. We prove that probabilistic simple splicing systems can also increase the computational power of the splicing 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	Probabilistic simple splicing systems
title_short	Probabilistic simple splicing systems
title_full	Probabilistic simple splicing systems
title_fullStr	Probabilistic simple splicing systems
title_full_unstemmed	Probabilistic simple splicing systems
title_sort	probabilistic simple splicing systems
publisher	American Institute of Physics
publishDate	2014
url	http://irep.iium.edu.my/37015/ http://irep.iium.edu.my/37015/ http://irep.iium.edu.my/37015/ http://irep.iium.edu.my/37015/1/37015_Probabilistic%20simple%20splicing%20systems.pdf http://irep.iium.edu.my/37015/2/37015_Probabilistic%20simple%20splicing%20systems_SCOPUS.pdf
first_indexed	2023-09-18T20:53:05Z
last_indexed	2023-09-18T20:53:05Z
_version_	1777410125039927296

Probabilistic simple splicing systems

Similar Items