Computing by splicing: programmed and evolving splicing systems

In the search for regulating mechanisms able to ensure computational universality for splicing systems and avoiding (some of the) non-realistic features of previous mechanisms of this type, we consider splicing systems with the splicing rules controlled by a next-rule mapping (like in programmed grammars). Then, this abstract model is "implemented" as a splicing system with the splicing rules themselves modified from a step to the next one by means of point mutations of the type one-symbol insertion/deletion.