DNA splicing systems with at most two cutting sites of a non-palindromic restriction enzyme
The modelling of splicing systems is simulated by the process of cleaving and recombining DNA molecules with the presence of a ligase and restriction enzymes which are biologically called as endodeoxyribonucleases. The molecules resulting from DNA splicing systems are known as splicing languages. Pa...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2019
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/84877/1/NorHanizaSarmin2019_DNASplicingSystemswithatMostTwo.pdf http://eprints.utm.my/id/eprint/84877/ https://dx.doi.org/10.11113/matematika.v35.n2.1108 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Language: | English |
| Summary: | The modelling of splicing systems is simulated by the process of cleaving and recombining DNA molecules with the presence of a ligase and restriction enzymes which are biologically called as endodeoxyribonucleases. The molecules resulting from DNA splicing systems are known as splicing languages. Palindrome is a sequence of strings that reads the same forward and backward. In this research, the splicing languages resulting from DNA splicing systems with one non-palindromic restriction enzyme are determined using the notation from Head splicing system. The generalisations of splicing languages for DNA splicing systems involving a cutting site and two non-overlapping cutting sites of one non-palindromic restriction enzyme are presented in the first and second theorems, respectively, which are proved using direct and induction methods. The result from the first theorem shows a trivial string which is the initial DNA molecule; while the second theorem determines a splicing language consisting of a set of resulting DNA molecules from the respective DNA splicing system. |
|---|