Mohd. Sham Mohamad

Some Relations Between Two Stages DNA Splicing Languages

A new symbolization of Yusof-Goode (Y-G) rule, which is associated with Y-G splicing system, was introduced by Yusof in 2012 under the framework of formal language theory. The purpose of this investigation is to present the biological process of DNA splicing in a translucent way. In this study, two stages splicing languages are introduced based on Y-G approach and some relations between stage one and stage two splicing languages are presented, given as theorems. Additionally, the existing relations between two stages splicing languages based on crossings and contexts of restriction enzymes factors with respect to two initial strings (having two cutting sites) and two rules are presented as subset.

Some sufficient conditions for persistency and permanency of two stages DNA splicing languages via Yusof-Goode approach

Splicing system that was first introduced by Head makes a connection between field of formal language theory and molecular biology. This system modeled the biological process of splitting and ligating on double stranded deoxyribonucleic acid (DNA) molecules under effect of restriction enzymes and appropriate ligase. In this paper, the concept of two stages DNA splicing languages is introduced. Some sufficient conditions for persistency and permanency of the above DNA splicing languages focusing on two rules and two initial strings will be investigated by usingYusof-Good (Y-G) approach.

Compatible pair of nontrivial actions for some cyclic groups of 2-power order

Compatible actions play a very important verification before the nonabelian tensor product can be computed. This paper gives the some exact number of compatible pairs of actions for some cyclic groups of 2-power order. Some necessary and sufficient numbers of theoretical conditions for a pair of cyclic groups of 2-power order with nontrivial actions which act compatibly on each other are used to investigate some properties in order to find the exact number of compatible pairs of actions. Algorithms in Groups, Algorithms and Programming (GAP) software are used to create more examples on selected cases. New results on compatible pair of nontrivial actions of order two and four for cyclic groups of 2-power order are presented in this paper.

Differentiating the Persistency and Permanency of Some Two Stages DNA Splicing Language via Yusof-Goode (Y-G) Approach

Predicting the existence of restriction enzymes sequences on the recombinant DNA fragments, after accomplishing the manipulating reaction, via mathematical approach is considered as a convenient way in terms of DNA recombination. In terms of mathematics, for this characteristic of the recombinant DNA strands, which involve the recognition sites of restriction enzymes, is called persistent and permanent. Normally differentiating the persistency and permanency of two stages recombinant DNA strands using wet-lab experiment is expensive and time-consuming due to running the experiment at two stages as well as adding more restriction enzymes on the reaction. Therefore, in this research, by using Yusof-Goode (Y-G) model the difference between persistent and permanent splicing language of some two stages is investigated. Two theorems were provided, which show the persistency and non-permanency of two stages DNA splicing language.

Persistency and permanency of two stages DNA splicing languages with respect to one initial string and two rules via Yusof-Goode (Y-G) approach

The notion of Yusof-Goode (Y-G) splicing system was first schemed by Yusof to study the relationship between formal language theory and molecular biology. The splicing languages that are produced by splicing system have some important characteristics called persistent and permanent. In biological perspective, the recombinant DNA molecules can be manipulated by recombination action if they have persistent property. Thus, the persistency as well as permanency of splicing languages (recombinant DNA molecules) is considered to be an interesting topic in the field of DNA recombination, particularly when the recombination process is accomplished at second stage. Conducting a wet-lab experiment to show the mentioned properties of splicing languages are time consuming and expensive. Therefore, to overcome this problem, mathematical approach is chosen to investigate the persistency and permanency of splicing languages which will be then given as theorem and corollary. Thus, an initial string (with two recognition sites) and two rules are considered for introducing the above characteristics using Y-G approach.