A splicing system is a mathematical model of recombinant behavior of DNA molecules under the influence of restriction enzymes and ligases and happened to be an interface between the formal language theory and molecular biology.
We have brought out some of the special properties of persistent splicing languages and the relationship with the other languages in Chomsky hierarchy. Also, we have discussed about some algebraic characterisations and investigated some properties like Closure, decidability, membership ,existence of test set and the significance of splicing as one of the non-local rearrangement operation in the evolutionary process of genomes.
On the application side, we have investigated the role of persistent splicing system in local testability in the strict sense and also discussed about its application to identifying the protein
region in amino acid sequences.and splicing operation as a viable theoretical model for DNA-based Computation as every extended splicing system with finite set of initial strings and regulat set of splicing rules can characterise recursively enumerable languages and thus attain the full power of Turing Machine.
Also, other variants of Splicing system like Uniform, Null, twist-free and Permanent splicing systems and their relationship with Persistent splicing language were also considered.
