The regular expressions of the resulted labelled graph in n-cut splicing Available to Purchase

Graph splicing is an extended study of splicing on deoxyribonucleic acid (DNA) molecules to counter the intricacy of explaining the idea of DNA splicing in the form of graphs instead of strings. An n-cut splicing is a type of splicing in graph splicing systems, which represents the cleavage pattern of the DNA splicing. An n-cut splicing can be applied to two types of graphs, which are unlabelled and labelled graphs. A labelled graph is a type of graph where the vertices are assigned with symbols or alphabets. After the recombination of the overhangs, the resulted labelled graphs are generated where the set of all resulted labelled graphs is called a language. This language is usually written in the form of strings containing the label of the graph without considering the position of the symbols labelled in the graph, but only the number of the symbols. In computer science, a language can be written as a regular expression where it can generate all strings in the language set. A regular expression varies the output of the generation of the strings and also helps to fix the pattern of the symbols in a specific string. Hence, in this study, the idea of n-cut splicing will be applied to labelled graph with two symbols where the graph can be denoted as a string and the position of each symbol in the graph is known. Besides, the regular expressions of the resulted labelled graph are presented.