Nooradelena Mohd Ruslim creator author. text my 2025 2025 monographic eng xvii, 110 pages : Illustrations (some colour) ; 30 cm.+ 1 CD-ROM Yusof-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. specialized Nooradelena Binti Mohd Ruslim Center for Mathematical Sciences Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2025 Includes bibliographical reference Center for Mathematical Sciences Dissertations Universities and colleges Dissertations Theses Dissertations THE0010071 (Local) UMPSA 250515 20251125111040.0 eng