Some analysis on certain types of splicing systems

Author

Heng, Fong Wan ; Sarmin, Nor Haniza ; Yusof, Yuhani

Author_Institution

Ibnu Sina Inst. for Fundamental Sci. Studies, Univ. Teknol. Malaysia, Johor Bahru, Malaysia

fYear

2010

fDate

23-26 Sept. 2010

Firstpage

1319

Lastpage

1321

Abstract

A mathematical model of a splicing system was firstly developed by Head in 1987. This model is abstractly analyzed in the framework of Formal Language Theory, which is a branch of Applied Discrete Mathematics and Theoretical Computer Science. This model consists of a finite set of initial strings over an alphabet that acts upon a finite set of rules. In this paper, some analysis on certain types of splicing systems namely, null-context, uniform, simple and S_kH system are presented as propositions and corollaries. Besides, some counterexamples are given to illustrate these relations.

Keywords

formal languages; genetic engineering; S_kH system; applied discrete mathematics; formal language theory; mathematical model; null-context system; simple system; splicing systems; theoretical computer science; uniform system; Artificial intelligence; Biological system modeling; Mathematical model; Scholarships; Formal Language Theory; mathematical model; splicing systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on

Conference_Location

Changsha

Print_ISBN

978-1-4244-6437-1

Type

conf

DOI

10.1109/BICTA.2010.5645073

Filename

5645073