000			03852ntm a2200337 i 4500
999			_c102537 _d102543
003			MY-KuUP
005			20251125111040.0
006			t||||fr|||| 000 0
007			ta
008			250515t20252025my a|||fr|||| 000 0 eng d
020			_aTHE0010071 (Local) _qHardback
040			_aUMPSA _beng _cUMPSA _erda
090			_aPSM .A34 2025 r Thesis
100	0		_aNooradelena Mohd Ruslim, _eauthor.
245	1	0	_aThe n-cutting sites in y-g splicing system and their de bruijn graph presentations / _cNooradelena Binti Mohd Ruslim
264		1	_aKuantan Pahang : _bUMPSA, _c2025
264		4	_c© 2025
300			_axvii, 110 pages : _bIllustrations (some colour) ; _c30 cm.+ _e1 CD-ROM
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
338			_2rdacarrier _avolume
347			_2rda _atext file _bPDF
500			_aCenter for Mathematical Sciences
502			_aThesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2025
504			_aIncludes bibliographical reference
520	3		_aYusof-Goode splicing system is a new symbolisation writing rule that shows the cutting process in a translucent way. This system is an extension of the pioneer Head splicing system under the framework of Formal Language Theory. In reality, conducting an experiment involving deoxyribonucleic acid (DNA) to obtain a specific restricted output can take a considerable amount of time, especially when it involves numerous dangling DNA sequences. In order to minimise the need to conduct repeated experimental trials, this research aims to explore how n-cutting sites, enzyme properties, and context features affect the DNA sequence formation. Mathematically, the generated DNA sequence of the experiment known as splicing language can be categorised as the inert, transient, limit, or active persistent language. Previous studies focused on splicing systems with one or two cutting sites. However, the impact of incorporating n-cutting sites on the generation and classification of splicing languages remains unexplored. Furthermore, the properties of palindromic and non-palindromic restriction enzymes, along with the influence of their left and right contexts on splicing languages have not been fully investigated. Additionally, current methodologies lack an effective framework for visualising and classifying splicing languages generated through splicing process. Though de Bruijn graphs have potential in this context, their application in representing and analysing splicing systems with n-cutting sites has not been adequately studied. This research addresses these gaps by investigating the effects of n-cutting sites in splicing systems using the Yusof-Goode approach, incorporating rule properties, left and right contexts effects, and leveraging de Bruijn graphs for classification and visualisation. These are shown through corollaries, lemmas and theorems which proposed via Formal Language Theory and proven via various methods, including mathematical induction and double induction. The lemmas and theorems proved that the splicing language generated from Y-G splicing system containing a string with n-cutting sites can be generalised and the results are applicable for simple and null-context splicing systems. Besides, the de Bruijn graph is employed to present the generated languages and demonstrate its efficacy in identifying the splicing languages. According to the observations, three types of splicing languages can be identified based on the path between vertices developed in the graph. Lastly, the presented lemmas and theorems are verified by using three established laboratory experimental results.
610	2	0	_aCenter for Mathematical Sciences _xDissertations
650		0	_aUniversities and colleges _xDissertations
650		0	_aTheses _xDissertations
942			_2lcc _cTHESIS