Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars
In DNA splicing system, DNA molecules are cut and recombined with the presence of restriction enzymes and a ligase. The splicing system is analyzed via formal language theory where the molecules resulting from the splicing system generate a language which is called a splicing language. In nature, DN...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Penerbit UTM Press
2019
|
| Subjects: |
| _version_ | 1796864803427319808 |
|---|---|
| author | Fong, Wan Heng Ismail, Nurul Izzaty Sarmin, Nor Haniza |
| author_facet | Fong, Wan Heng Ismail, Nurul Izzaty Sarmin, Nor Haniza |
| author_sort | Fong, Wan Heng |
| collection | ePrints |
| description | In DNA splicing system, DNA molecules are cut and recombined with the presence of restriction enzymes and a ligase. The splicing system is analyzed via formal language theory where the molecules resulting from the splicing system generate a language which is called a splicing language. In nature, DNA molecules can be read in two ways; forward and backward. A sequence of string that reads the same forward and backward is known as a palindrome. Palindromic and non-palindromic sequences can also be recognized in restriction enzymes. Research on splicing languages from DNA splicing systems with palindromic and non-palindromic restriction enzymes have been done previously. This research is motivated by the problem of DNA assembly to read millions of long DNA sequences where the concepts of automata and grammars are applied in DNA splicing systems to simplify the assembly in short-read sequences. The splicing languages generated from DNA splicing systems with palindromic and nonpalindromic restriction enzymes are deduced from the grammars which are visualised as automata diagrams, and presented by transition graphs where transition labels represent the language of DNA molecules resulting from the respective DNA splicing systems. |
| first_indexed | 2024-03-05T20:47:18Z |
| format | Article |
| id | utm.eprints-89303 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T20:47:18Z |
| publishDate | 2019 |
| publisher | Penerbit UTM Press |
| record_format | dspace |
| spelling | utm.eprints-893032021-02-09T08:26:02Z http://eprints.utm.my/89303/ Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars Fong, Wan Heng Ismail, Nurul Izzaty Sarmin, Nor Haniza QA Mathematics In DNA splicing system, DNA molecules are cut and recombined with the presence of restriction enzymes and a ligase. The splicing system is analyzed via formal language theory where the molecules resulting from the splicing system generate a language which is called a splicing language. In nature, DNA molecules can be read in two ways; forward and backward. A sequence of string that reads the same forward and backward is known as a palindrome. Palindromic and non-palindromic sequences can also be recognized in restriction enzymes. Research on splicing languages from DNA splicing systems with palindromic and non-palindromic restriction enzymes have been done previously. This research is motivated by the problem of DNA assembly to read millions of long DNA sequences where the concepts of automata and grammars are applied in DNA splicing systems to simplify the assembly in short-read sequences. The splicing languages generated from DNA splicing systems with palindromic and nonpalindromic restriction enzymes are deduced from the grammars which are visualised as automata diagrams, and presented by transition graphs where transition labels represent the language of DNA molecules resulting from the respective DNA splicing systems. Penerbit UTM Press 2019-12 Article PeerReviewed Fong, Wan Heng and Ismail, Nurul Izzaty and Sarmin, Nor Haniza (2019) Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars. Matematika: Malaysian Journal Of Industrial And Applied Mathematics, 35 . pp. 1-14. ISSN 0127-9602 http://dx.doi.org/10.11113/matematika.v35.n4.1260 |
| spellingShingle | QA Mathematics Fong, Wan Heng Ismail, Nurul Izzaty Sarmin, Nor Haniza Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars |
| title | Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars |
| title_full | Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars |
| title_fullStr | Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars |
| title_full_unstemmed | Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars |
| title_short | Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars |
| title_sort | automata for dna splicing languages with palindromic and non palindromic restriction enzymes using grammars |
| topic | QA Mathematics |
| work_keys_str_mv | AT fongwanheng automatafordnasplicinglanguageswithpalindromicandnonpalindromicrestrictionenzymesusinggrammars AT ismailnurulizzaty automatafordnasplicinglanguageswithpalindromicandnonpalindromicrestrictionenzymesusinggrammars AT sarminnorhaniza automatafordnasplicinglanguageswithpalindromicandnonpalindromicrestrictionenzymesusinggrammars |