Sarmin, Nor Haniza and Karimi, Fariba and Fong, Wan Heng (2010) Some sufficient conditions for persistent splicing systems. In: International Conference on Mathematical Applications in Engineering (ICMAE '10), 3-5 August 2010.
Full text not available from this repository.
Splicing system was first defined by Head in 1987 as a mathematical model of the generative capacity of a biological system containing DNA molecules in the presence of appropriate enzymes. The formalism of splicing system is illustrated under the framework of Formal Language Theory which is a branch of applied discrete mathematics and theoretical computer science. In fact, this is a mathematical model for the recombinant behavior of DNA molecules under the influence of restriction enzymes. In this sense, DNA molecules and restriction enzymes are associated with strings and rules, respectively. There are many different types of splicing systems that have been defined by Head and other mathematicians. Some important ones are persistent, permanent and strictly locally testable splicing systems. In this paper, we provide some sufficient conditions for splicing systems to be persistent. Besides, some real examples are provided to support the theorems in the biological sense.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||International Conference on Mathematical and Computational Biology 2011 (ICMCB 2011), Renaissance Melaka Hotel, Melaka, Malaysia, 12-14 April 2011.|
|Uncontrolled Keywords:||DNA molecules' formal language theory, persistent splicing systems, splicing systems|
|Deposited By:||Liza Porijo|
|Deposited On:||09 Aug 2012 08:25|
|Last Modified:||07 Feb 2017 07:43|
Repository Staff Only: item control page