Mathematical modelling of some uniform and null-context splicing systems
Head first proposed the mathematical modeling of splicing system which involves recombination of DNA molecules in 1987. Splicing of DNA involves cutting of DNA molecules using the restriction enzymes and reassociating different fragments of DNA molecules using the ligases under some specific chemica...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2011
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/47953/25/LimShunJinnMFS2011.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Head first proposed the mathematical modeling of splicing system which involves recombination of DNA molecules in 1987. Splicing of DNA involves cutting of DNA molecules using the restriction enzymes and reassociating different fragments of DNA molecules using the ligases under some specific chemical conditions. A splicing language, L is generated if there exists a splicing system S for which L = L(S). Some splicing languages namely persistent splicing language and strictly locally testable language are equivalent to uniform splicing language. Since uniform splicing system is also a null-context splicing system, hence, uniform and null-context splicing systems are discussed in this research. Besides, some molecular examples on uniform and null-context splicing systems with different initial strings and combination of restriction enzymes are presented. Applications of automata theory on these molecular examples of uniform and null-context languages are also presented in this research. |
|---|