Splicing systems over permutation groups of length two

The first theoretical model of DNA computing, called a splicing system, for the study of the generative power of deoxyribonucleic acid (DNA) in the presence of restriction enzymes and ligases was introduced by Head in 1987. Splicing systems model the recombinant behavior of double-stranded DNA (dsDN...

Full description

Bibliographic Details
Main Authors:	Hamzah, Nur Zatul Akmar, Mohd Sebry, Nurul Afidah, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Article
Language:	English
Published:	Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2012
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/26984/ http://irep.iium.edu.my/26984/ http://irep.iium.edu.my/26984/1/Splicing_Systems_over_Permutation_Groups_of_Length_Two.pdf

id	iium-26984
recordtype	eprints
spelling	iium-269842017-02-17T09:51:32Z http://irep.iium.edu.my/26984/ Splicing systems over permutation groups of length two Hamzah, Nur Zatul Akmar Mohd Sebry, Nurul Afidah Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science The first theoretical model of DNA computing, called a splicing system, for the study of the generative power of deoxyribonucleic acid (DNA) in the presence of restriction enzymes and ligases was introduced by Head in 1987. Splicing systems model the recombinant behavior of double-stranded DNA (dsDNA) and the enzymes which perform operation of cutting and pasting on dsDNA. Splicing systems with finite sets of axioms and rules generate only regular languages when no additional control is assumed. With several restrictions to splicing rules, the generative power increase up to recursively enumerable languages. Algebraic structures can also be used in order to control the splicing systems. In the literature, splicing systems with additive and multiplicative valences have been investigated, and it has been shown that the family of languages generated by valence splicing systems is strictly included in the family of context-sensitive languages. This motivates the study of splicing systems over permutation groups. In this paper, we define splicing systems over permutation groups and investigate the generative power of the languages produced. Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2012-02-15 Article PeerReviewed application/pdf en http://irep.iium.edu.my/26984/1/Splicing_Systems_over_Permutation_Groups_of_Length_Two.pdf Hamzah, Nur Zatul Akmar and Mohd Sebry, Nurul Afidah and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2012) Splicing systems over permutation groups of length two. Malaysian Journal of Fundamental and Applied Sciences, 8 (2). pp. 83-88. ISSN 1823-626X http://mjfas.ibnusina.utm.my/index.php/jfs/article/viewFile/280/210
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 Hamzah, Nur Zatul Akmar Mohd Sebry, Nurul Afidah Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Splicing systems over permutation groups of length two
description	The first theoretical model of DNA computing, called a splicing system, for the study of the generative power of deoxyribonucleic acid (DNA) in the presence of restriction enzymes and ligases was introduced by Head in 1987. Splicing systems model the recombinant behavior of double-stranded DNA (dsDNA) and the enzymes which perform operation of cutting and pasting on dsDNA. Splicing systems with finite sets of axioms and rules generate only regular languages when no additional control is assumed. With several restrictions to splicing rules, the generative power increase up to recursively enumerable languages. Algebraic structures can also be used in order to control the splicing systems. In the literature, splicing systems with additive and multiplicative valences have been investigated, and it has been shown that the family of languages generated by valence splicing systems is strictly included in the family of context-sensitive languages. This motivates the study of splicing systems over permutation groups. In this paper, we define splicing systems over permutation groups and investigate the generative power of the languages produced.
format	Article
author	Hamzah, Nur Zatul Akmar Mohd Sebry, Nurul Afidah Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod
author_facet	Hamzah, Nur Zatul Akmar Mohd Sebry, Nurul Afidah Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod
author_sort	Hamzah, Nur Zatul Akmar
title	Splicing systems over permutation groups of length two
title_short	Splicing systems over permutation groups of length two
title_full	Splicing systems over permutation groups of length two
title_fullStr	Splicing systems over permutation groups of length two
title_full_unstemmed	Splicing systems over permutation groups of length two
title_sort	splicing systems over permutation groups of length two
publisher	Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
publishDate	2012
url	http://irep.iium.edu.my/26984/ http://irep.iium.edu.my/26984/ http://irep.iium.edu.my/26984/1/Splicing_Systems_over_Permutation_Groups_of_Length_Two.pdf
first_indexed	2023-09-18T20:40:07Z
last_indexed	2023-09-18T20:40:07Z
_version_	1777409308869263360

Splicing systems over permutation groups of length two

Similar Items