On n-cut splicing and its properties

• Main Authors: Fong, Wan Heng, Razak, Muhammad Nur Syiham Abdul, Sarmin, Nor Haniza
• Format: Conference Proceeding
• Language: English
• Subjects: Computation; Graph theory; Graphs; Splicing
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/5.0078670

Concepts in graph theory are widely applied in various fields, where graphs are used to describe problems in order to give methods of solutions. In DNA computing, the complexity of DNA splicing process has led to the study on graph splicing system. Basically, a graph splicing system is introduced to illustrate three dimensional DNA splicing processes in the form of graphs instead of using one dimensional strings, as originally defined in DNA computing. The graphs are constructed to illustrate the structure of the DNA strands and the restriction enzymes used in the splicing system. Particularly, the cleavage site of the DNA splicing can be described by a graph splicing called as n-cut splicing in which the cutting sites are shown in the graph. Meanwhile, the sticky ends of the spliced DNA molecules can be illustrated as components of n-cut spliced semigraphs which are generated from the n-cut splicing process. There are various types of graph splicings whereby every splicing describes the behavior of the splicing process. In this research, some properties of the graph splicing system by using n-cut splicing are determined. Besides that, a sufficient condition for the process of n-cut splicing is also obtained.