An Extension of DNA Splicing Systems
The first mathematical model of a splicing system that was analyzed in the framework of Formal Language Theory was developed in 1987 by Head. This model consists of a finite alphabet, a finite set of initial strings over the alphabet, and a finite set of rules that act upon the strings by iterated...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/9528/1/6.%202011-%20PI-%20Scopus-%20An%20Extension%20of%20DNA%20Splicing%20System.pdf http://umpir.ump.edu.my/id/eprint/9528/ http://dx.doi.org/10.1109/BIC-TA.2011.67 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The first mathematical model of a splicing system that was analyzed in the framework of Formal Language Theory was developed in 1987 by Head. This model consists of
a finite alphabet, a finite set of initial strings over the alphabet, and a finite set of rules that act upon the strings by iterated cutting and pasting, generating new strings. In this paper, a new notation for writing rules in a splicing system and a new extension of splicing systems is introduced in order to make the biological process transparent. These are called Yusof-Goode rules, and they are associated with Yusof-Goode splicing systems. Four different classes of splicing systems are
discussed: null-context, uniform, simple and SkH systems. Also, counterexamples are given to illustrate relationships between these splicing system classes. |
|---|