A splicing operation, as a model of gene splicing, is introduced as an operator on strings. A splicing system is defined by giving an initial language I and a set of special words or rules R. The set I is then transformed by repeated applications of the splicing operation. Depending on the definition of the splicing operation we refer to, we have different definitions of linear splicing systems and of circular splicing systems. Here, we focus on finite splicing systems that are closest to the biological process. Indeed, they are defined by a finite set of rules and a finite set of initial strings. We discuss results concerning both circular and linear finite splicing systems
Bonizzoni, P., De Felice, C., Mauri, G. (2005). Recombinant DNA, Gene Splicing as Generative Devices of Formal Languages. In New Computational Paradigms. First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Proceedings (pp.65-67). Berlin : Springer Verlag [10.1007/11494645_8].
Recombinant DNA, Gene Splicing as Generative Devices of Formal Languages
BONIZZONI, PAOLA;MAURI, GIANCARLO
2005
Abstract
A splicing operation, as a model of gene splicing, is introduced as an operator on strings. A splicing system is defined by giving an initial language I and a set of special words or rules R. The set I is then transformed by repeated applications of the splicing operation. Depending on the definition of the splicing operation we refer to, we have different definitions of linear splicing systems and of circular splicing systems. Here, we focus on finite splicing systems that are closest to the biological process. Indeed, they are defined by a finite set of rules and a finite set of initial strings. We discuss results concerning both circular and linear finite splicing systems
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
