000 02765ntm a2200277 a 4500
001 vtls000091391
003 KUKTEM
005 20251117113307.0
008 151005t2015 my a f m 000 0 eng d
020 _aTHE0002002(Local)
039 9 _a201905140940
_byusri
_c201905131600
_dyusri
_c201710091216
_daishah
_y201510051026
_zhuda
040 _aUMP
090 _aQA267.3 .H37 2015 r Thesis
100 0 _aMohammad Hassan Mudaber
245 1 _aPersistency and permanency of two stages splicing languages based on DNA recombination process by using Yusof-Goode (Y-G) approach /
_cMohammad Hassan Mudaber
260 _aKuantan, Pahang :
_bUMP,
_c2015
300 _axv, 120 p. :
_bill. (some col.) ;
_c30 cm. +
_e2 CD ROM
500 _aFaculty of Industrial Sciences and Technology
502 _aThesis (Master of Science (Mathematics)) -- Universiti Malaysia Pahang – 2015
504 _aBibliography : p. 112-115
520 3 _aThe 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.
650 0 _aFormal languages
650 0 _aDeoxyribonucleic acid (DNA)
856 4 0 _uhttp://ecollib.ump.edu.my/3584/
_zLibrary access only
999 _aVIRTUA40
_c6244
_d6250
999 _aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5000*5020*5040*5200*6500*6501*8560*9992