Abstract
Splicing language is the language which results from a splicing system. Splicing system was first introduced by Tom Head in 1987 as the mathematical model of systems of restriction enzymes acting on initial DNA molecules. Splicing languages are closely related to automata theory. Simple splicing systems can be recognized by SH-automata diagrams due to the regularity of splicing languages. SH-automaton defines exactly one language which is the language generated by the simple splicing system. In this paper, the concept of firm and maximal firm subwords are introduced. Some examples are then given to illustrate the maximal firm subwords of a word in a simple splicing system. Taking the SH-automata concept, which is a short compact way of encoding normal non-deterministicautomata in the special case of SH systems, the maximal firm subwords of the initial words of an SH systems serve as the labels for the associated SH-automaton. Some examples which will show the maximal firm subwords of the words in the initial set I, the regular expression for the language generated by the given splicing system and the simplest non-deterministic automaton that recognizes the corresponding splicing system are also given
Highlights
Splicing system was developed as a mathematical model of systems of restriction enzymes acting on initial DNA molecules [1]
DNA molecules can be cut by restriction enzymes at particular sequence of the nucleotides
The set of double-stranded DNA molecules that may arise from a splicing system is called the splicing language
Summary
Splicing system was developed as a mathematical model of systems of restriction enzymes acting on initial DNA molecules [1]. The set of double-stranded DNA molecules that may arise from a splicing system is called the splicing language. [1] (Splicing System and Splicing Language) A splicing system S = (A, I, B, C) consists of a finite set of alphabet A, a finite set of initial strings I in A*, and finite sets B and C of triples (c, x, d) with c, x and d in A* Each such triple in B or C is called a pattern. The formal definitions of a simple splicing system and a simple splicing language are given in the following. The definition of a regular language is given in the following. The concepts of firm and maximal firm subwords of a word are discussed
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Malaysian Journal of Fundamental and Applied Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
