02765ntm a2200277 a 4500 vtls000091391 KUKTEM 20251117113307.0 151005t2015 my a f m 000 0 eng d THE0002002(Local) 201905140940 yusri 201905131600 yusri 201710091216 aishah 201510051026 huda UMP QA267.3 .H37 2015 r Thesis Mohammad Hassan Mudaber Persistency and permanency of two stages splicing languages based on DNA recombination process by using Yusof-Goode (Y-G) approach / Mohammad Hassan Mudaber Kuantan, Pahang : UMP, 2015 xv, 120 p. : ill. (some col.) ; 30 cm. + 2 CD ROM Faculty of Industrial Sciences and Technology Thesis (Master of Science (Mathematics)) -- Universiti Malaysia Pahang – 2015 Bibliography : p. 112-115 The study of the biological process of deoxyribonucleic acid (DNA) splicing was investigated by Yusof in 2012 as a translucent approach under framework of formal languages theory. The investigation was achieved by proposing a new symbolization representing the rule in splicing system called Yusof-Goode (Y-G) rule associated with Y-G splicing system. A laboratory experiment is usually performed to show the DNA splicing process under the existence of restriction enzyme and appropriate ligase. This laboratory experiment is time consuming process and it can incur a lot of expenses. In addition, to accomplish the reaction up to two stages the generating recombining DNA molecules must have persistency concept. Thus, to overcome this problem, mathematical approach via Y-G model is applied to introduce the new concept of splicing system at two stages with respect to two initial strings and two rules. Furthermore, the existence relation between the families of stage one and stage two splicing languages are investigated. In this investigation, some sufficient conditions for persistency and permanency of two stages DNA splicing languages according to the number of cutting sites of initial strings and properties of rules are provided. The de Bruijn graph is used to predict the persistency and permanency of two stages splicing languages. A user friendly interface as an alternative of wet-lab experiment is coded using Microsoft Visual C Sharp (C#) to predict the persistency and permanency, and the relations between two stages (stage one and stage two) splicing languages. Formal languages Deoxyribonucleic acid (DNA) http://ecollib.ump.edu.my/3584/ Library access only 0 0 lcc 0 6 10000 10000 2019-09-04 0 QA267.3 .H37 2015 r Thesis 0000107803 2019-09-04 00:00:00 2 2019-09-04 THESIS c.2 0 0 lcc 0 1 10000 10000 2019-09-04 0 CD 9661 | QA267.3 .H37 2015 r Thesis 0000107804 2019-09-04 00:00:00 3 2019-09-04 THESIS c.3 0 0 lcc 0 1 10000 10000 2019-09-04 0 QA267.3 .H37 2015 r Thesis 0000100304 2019-09-04 00:00:00 1 2019-09-04 THESIS 0 0 lcc 0 6 10000 10000 2019-09-04 0 CD 8902 | QA267.3 .H37 2015 r Thesis 0000100306 2019-09-04 00:00:00 1 2019-09-04 THESIS 0 0 lcc 0 1 10000 10000 2019-09-04 0 CD 8867 | QA267.3 .H37 2015 r Thesis 0000100305 2019-09-04 00:00:00 2 2019-09-04 THESIS VIRTUA40 6244 6250 VTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5000*5020*5040*5200*6500*6501*8560*9992