A New Relation of Second Order Limit Language in Simple and Semi-Simple Splicing System

Authors

  • Muhammad Azrin Ahmad Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor Malaysia
  • Nor Haniza Sarmin Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor Malaysia
  • Wan Heng Fong Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor Malaysia
  • Yuhani Yusof Faculty of Industrial Science and Technology, Universiti Malaysia Pahang, 26300 UMP Gambang, Pahang

DOI:

https://doi.org/10.11113/jt.v71.3845

Keywords:

Y-G splicing system, Y-G splicing language, second order limit language

Abstract

Splicing system, which is an abstraction of operations on DNA molecules, can be modelled mathematically under the framework of formal language theory and informational macromolecules. The recombinant behavior of the set of double-stranded DNA molecules under the influence of restriction enzyme and ligase further lead to the cut and paste phenomenon in splicing system. The theoretical study of splicing language has contributed to a new type of splicing language known as a second order limit language, which is an extension of limit language. Some types of splicing system can produce second order limit language. Y-G splicing system is chosen among other models to model the DNA splicing process as this model preserves the biological traits and presents the transparent behavior of the DNA splicing process. In this paper, the relation between second order limit language with simple splicing and semi-simple splicing system are presented.

References

Tamarin, R.H. 2001. 7th Edition. Principles of Genetics. USA: The Mac - Graw Hill Companies.

Paun, G., Rozernberg, G. and Salomaa, A. 1998. DNA Computing New Computing Paradigm. Germany: Springer Verlag.

Head, T. 1987. Formal Language Theory and DNA: An Analysis of Generative Capacity of Specific Recombinant Behaviors. Bulletin of Mathematical Biology. 49 (6). 737–759.

Goode, T.E. 1999. Constant and Splicing System. Ph.D. Thesis. State University of New York.

Yusof, Y. 2011. Bio Molecular Inspiration in DNA Splicing System. Ph.D. Thesis. Universiti Teknologi Malaysia.

Ahmad, M.A., Sarmin, N.H., Fong, W.H. and Yusof, Y. 2014. An Extension of First Order Limit Language. AIP Proceedings. 1602: 627–631.

Goode, E. and Pixton, D. 2004. Splicing to the Limit. Lecture Notes in Computer Science. 2950: 189-201.

Fong, W.H. 2008. Modelling of Splicing Systems Using Formal Language Theory. Ph.D. Thesis. Universiti Teknologi Malaysia.

Karimi, F. 2013. Mathematical Modelling of Persistent Splicing Systems in DNA Computing. Ph.D. Thesis, Universiti Teknologi Malaysia.

Laun, E. and Reddy, K.J. 1997. Wet Splicing Systems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 48: 73–86.

Linz, P. 2006. An Introduction to Formal Languages and Automata. USA: Jones and Bartlett Publishers.

Mateescu, A., Paun, Gh., Rozenberg, G. and Salomaa, A. 1998.

Downloads

Published

2014-12-30

Issue

Vol. 71 No. 5: ​Special Issue on Fifth International Graduate Conference on Engineering, Science & Humanities

Section

Science and Engineering

License

Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.

How to Cite

A New Relation of Second Order Limit Language in Simple and Semi-Simple Splicing System. (2014). Jurnal Teknologi, 71(5). https://doi.org/10.11113/jt.v71.3845