Mathematical modelling of splicing systems on DNA molecules
Splicing system was originally developed by Tom Head in 1987 as the generative capacity of systems of restriction enzymes acting on DNA molecules. Splicing system can be modelled mathematically. The language which results from a splicing system is called a splicing language. This language can furthe...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Monograph |
| Published: |
Faculty of Science
2008
|
| Online Access: | http://eprints.utm.my/id/eprint/9077/ https://www.researchgate.net/publication/236901033_Mathematical_Modelling_of_Splicing_Systems |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my.utm.9077 |
|---|---|
| record_format |
eprints |
| spelling |
my.utm.90772017-09-02T04:18:03Z http://eprints.utm.my/id/eprint/9077/ Mathematical modelling of splicing systems on DNA molecules Sarmin, Nor Haniza Abdul Rashid, Noor Aini Ibrahim, Zuwairie Fong , Wan Heng Abdul Wahab, Mohd. Firdaus Lim, Deborah Shin Fei Splicing system was originally developed by Tom Head in 1987 as the generative capacity of systems of restriction enzymes acting on DNA molecules. Splicing system can be modelled mathematically. The language which results from a splicing system is called a splicing language. This language can further be analyzed using concepts in formal language theory, which is a branch of theoretical computer science and applied discrete mathematics. A splicing language contains the initial strings of DNA molecules and is closed under the application of splicing rules. Among the different types of splicing languages is the strictly locally testable language. In this thesis, some examples of not strictly locally testable language are given and some theorems concerning different combination of restriction enzymes in a strictly locally testable language are stated with the proofs. This thesis also discusses simple splicing system, which includes several new theorems regarding the concepts of factors, constants and prime constants of a language, and also some facts on solid codes. Some examples on maximal firm subwords and the automaton that recognize a splicing system are also included and discussed. Lastly, the wet-lab experiment that has been done to verify the mathematical model and to show the difference between the adult and limit language are presented. This experiment has successfully tested the hypothesis that a particular splicing system will converge to a fixed set of strings. Faculty of Science 2008-11-30 Monograph NonPeerReviewed Sarmin, Nor Haniza and Abdul Rashid, Noor Aini and Ibrahim, Zuwairie and Fong , Wan Heng and Abdul Wahab, Mohd. Firdaus and Lim, Deborah Shin Fei (2008) Mathematical modelling of splicing systems on DNA molecules. Project Report. Faculty of Science, Skudai, Johor. (Unpublished) https://www.researchgate.net/publication/236901033_Mathematical_Modelling_of_Splicing_Systems |
| institution |
Universiti Teknologi Malaysia |
| building |
UTM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Teknologi Malaysia |
| content_source |
UTM Institutional Repository |
| url_provider |
http://eprints.utm.my/ |
| description |
Splicing system was originally developed by Tom Head in 1987 as the generative capacity of systems of restriction enzymes acting on DNA molecules. Splicing system can be modelled mathematically. The language which results from a splicing system is called a splicing language. This language can further be analyzed using concepts in formal language theory, which is a branch of theoretical computer science and applied discrete mathematics. A splicing language contains the initial strings of DNA molecules and is closed under the application of splicing rules. Among the different types of splicing languages is the strictly locally testable language. In this thesis, some examples of not strictly locally testable language are given and some theorems concerning different combination of restriction enzymes in a strictly locally testable language are stated with the proofs. This thesis also discusses simple splicing system, which includes several new theorems regarding the concepts of factors, constants and prime constants of a language, and also some facts on solid codes. Some examples on maximal firm subwords and the automaton that recognize a splicing system are also included and discussed. Lastly, the wet-lab experiment that has been done to verify the mathematical model and to show the difference between the adult and limit language are presented. This experiment has successfully tested the hypothesis that a particular splicing system will converge to a fixed set of strings. |
| format |
Monograph |
| author |
Sarmin, Nor Haniza Abdul Rashid, Noor Aini Ibrahim, Zuwairie Fong , Wan Heng Abdul Wahab, Mohd. Firdaus Lim, Deborah Shin Fei |
| spellingShingle |
Sarmin, Nor Haniza Abdul Rashid, Noor Aini Ibrahim, Zuwairie Fong , Wan Heng Abdul Wahab, Mohd. Firdaus Lim, Deborah Shin Fei Mathematical modelling of splicing systems on DNA molecules |
| author_facet |
Sarmin, Nor Haniza Abdul Rashid, Noor Aini Ibrahim, Zuwairie Fong , Wan Heng Abdul Wahab, Mohd. Firdaus Lim, Deborah Shin Fei |
| author_sort |
Sarmin, Nor Haniza |
| title |
Mathematical modelling of splicing systems on DNA molecules |
| title_short |
Mathematical modelling of splicing systems on DNA molecules |
| title_full |
Mathematical modelling of splicing systems on DNA molecules |
| title_fullStr |
Mathematical modelling of splicing systems on DNA molecules |
| title_full_unstemmed |
Mathematical modelling of splicing systems on DNA molecules |
| title_sort |
mathematical modelling of splicing systems on dna molecules |
| publisher |
Faculty of Science |
| publishDate |
2008 |
| url |
http://eprints.utm.my/id/eprint/9077/ https://www.researchgate.net/publication/236901033_Mathematical_Modelling_of_Splicing_Systems |
| _version_ |
1643645112351195136 |
| score |
13.211869 |