Some properties of probabilistic semi-simple splicing systems

The concept of splicing system was first introduced by Head in 1987. This model has been introduced to investigate the recombinant behavior of DNA molecules. Over the years, various types of splicing languages have been defined and studied by different mathematicians. Splicing systems with finite se...

Full description

Bibliographic Details
Main Authors:	Mathuri, S., Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Conference or Workshop Item
Language:	English
Published:	2012
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/27319/ http://irep.iium.edu.my/27319/ http://irep.iium.edu.my/27319/1/ISPC_2012_329-344.pdf

id	iium-27319
recordtype	eprints
spelling	iium-273192012-12-27T02:31:20Z http://irep.iium.edu.my/27319/ Some properties of probabilistic semi-simple splicing systems Mathuri, S. Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science The concept of splicing system was first introduced by Head in 1987. This model has been introduced to investigate the recombinant behavior of DNA molecules. Over the years, various types of splicing languages have been defined and studied by different mathematicians. Splicing systems with finite sets of axioms only generate regular languages. Therefore, different restrictions have been considered to increase the computational power up to the recursively enumerable languages. In this research, a variant of splicing systems called probabilistic splicing systems has been used to define different types of splicing systems such as probabilistic simple splicing systems, probabilistic semi-simple splicing systems and probabilistic one-sided splicing systems. In probabilistic splicing systems, probabilities (real numbers in the range of 0 and 1) are associated with the axioms, and the probability p(z)of the string z generated from two strings x and y is calculated from the probability p(x)and p(y) according to the operation (multiplication) defined on the probabilities, i.e., p(z) = p(x) p(y). 2012-11-27 Conference or Workshop Item NonPeerReviewed application/pdf en http://irep.iium.edu.my/27319/1/ISPC_2012_329-344.pdf Mathuri, S. and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2012) Some properties of probabilistic semi-simple splicing systems. In: International Science Postgraduate Conference 2012 (ISPC 2012), 27-30 November 2012, Skudai, Johor. http://events.utm.my/blog/event/international-science-postgraduate-conference-2012-ispc-2012/
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 Mathuri, S. Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Some properties of probabilistic semi-simple splicing systems
description	The concept of splicing system was first introduced by Head in 1987. This model has been introduced to investigate the recombinant behavior of DNA molecules. Over the years, various types of splicing languages have been defined and studied by different mathematicians. Splicing systems with finite sets of axioms only generate regular languages. Therefore, different restrictions have been considered to increase the computational power up to the recursively enumerable languages. In this research, a variant of splicing systems called probabilistic splicing systems has been used to define different types of splicing systems such as probabilistic simple splicing systems, probabilistic semi-simple splicing systems and probabilistic one-sided splicing systems. In probabilistic splicing systems, probabilities (real numbers in the range of 0 and 1) are associated with the axioms, and the probability p(z)of the string z generated from two strings x and y is calculated from the probability p(x)and p(y) according to the operation (multiplication) defined on the probabilities, i.e., p(z) = p(x) p(y).
format	Conference or Workshop Item
author	Mathuri, S. Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod
author_facet	Mathuri, S. Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod
author_sort	Mathuri, S.
title	Some properties of probabilistic semi-simple splicing systems
title_short	Some properties of probabilistic semi-simple splicing systems
title_full	Some properties of probabilistic semi-simple splicing systems
title_fullStr	Some properties of probabilistic semi-simple splicing systems
title_full_unstemmed	Some properties of probabilistic semi-simple splicing systems
title_sort	some properties of probabilistic semi-simple splicing systems
publishDate	2012
url	http://irep.iium.edu.my/27319/ http://irep.iium.edu.my/27319/ http://irep.iium.edu.my/27319/1/ISPC_2012_329-344.pdf
first_indexed	2023-09-18T20:40:37Z
last_indexed	2023-09-18T20:40:37Z
_version_	1777409339779186688

Some properties of probabilistic semi-simple splicing systems

Similar Items