Some relations on different types of splicing systems
Keywords:Splicing systems, Formal Language Theory,
Splicing system is a formal characterization of the generative capacity of specified enzymatic activities acting on initial DNA molecules that was first initiated by Head in 1987. This splicing system is formally illustrated under the framework of Formal Language Theory which is a branch of Theoretical Computer Science and Applied Discrete Mathematics. There are many types of splicing systems including null-context, simple, semi-simple and seminull. In this paper, some relations for those types of splicing systems are presented.
R. H. Tamarin, Principle of Genetics, Seventh Edition (2001).
Research Biolabs Sdn. Bhd., New England Biolabs 2007-08 Catalog & Technical Reference, (2007).
T. Head, Bull. Math. Biology, 49 (1987) 737-759.
A. Mateescu, Gh. Paun, G. Rozenberg and A. Salomaa, Discrete Applied Mathematics, 84 (1998) 145-163.
W. H. Fong, Ph.D. Thesis, Universiti Teknologi Malaysia, (2008).
E. G. Laun, Ph.D. Thesis, State University of New York at Binghamton, (1999).
E. Goode and D. Pixton, In: Martin-Vide, C. and Mitrana, V. eds. Where Mathematics, Computer Science, Linguistics and Biology Meet, (2001)
R. Ceterchi, Fundamenta Informaticae, 73(1-2) (2006) 19-25.
R. W. Gatterdam, International Journal of Computer Math., 31(1989) 63-67.
P. Linz, An Introduction to Formal Languages and Automata, Third Edition (2001)