Finite Splicing: Generative Capacity, New Models and Complexity Aspects
Splicing systems have been introduced twenty years ago as a basic abstract model of the DNA recombination mechanism. In fact, it was the first of a long series of computational models based on a molecular process. Much research has been done on the generative capacity of these systems, mostly considering enhanced variants of the original definition. However, some important questions about the original finite systems are still unsolved. For example, we do not have any systematic way to go about constructing a splicing system for a given language, and we still lack significant algorithmic results for this model.
In this work, we survey new research directions on finite splicing that could suggest a new approach to the solution of these basic problems and could shed a new light on the splicing formalism. These include an alternative definition of the splicing language, splicing systems as accepting devices, and complexity issues for splicing systems.
Unable to display preview. Download preview PDF.
- 5.Bonizzoni P, De Felice C, Mauri G, Zizza R (2003) Decision problems on linear and circular splicing. In: Ito M, Toyama M (eds) Proceedings of the DLT 2002. Lecture notes in computer science, vol 2450. Springer, Berlin, pp 78–92 Google Scholar
- 6.Bonizzoni P, De Felice C, Mauri G, Zizza R (2003) Regular languages generated by reflexive finite linear splicing systems. In: Proceedings of the DLT 2003. Lecture notes in computer science, vol 2710. Springer, Berlin, pp 134–145 Google Scholar
- 8.Bonizzoni P, Ferretti C, Mauri G (1998) Splicing systems with marked rules. Rom J Inf Sci Technol 1(4):295–306 Google Scholar
- 10.Bonizzoni P, Mauri G (2006) A decision procedure for reflexive regular splicing languages. Dev Lang Theory 315–326 Google Scholar
- 14.Goode E (1999) Constants and splicing systems. PhD thesis, Binghamton University Google Scholar
- 17.Head T (1998) Splicing languages generated with one sided context. In: Păun Gh (ed) Computing with bio-molecules. Theory and experiments. Springer, Singapore Google Scholar
- 18.Head T, Păun Gh, Pixton D (1996) Language theory and molecular genetics: generative mechanisms suggested by DNA recombination. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol 2. Springer, Berlin, pp 295–360 Google Scholar
- 25.Loos R, Ogihara M (2007) Time and space complexity for splicing systems. Theory Comput Syst (in press) Google Scholar
- 28.Perrin D (1990) Finite automata. In: Van Leeuwen J (ed) Handbook of theoretical computer science, vol B. Elsevier, Amsterdam, pp 1–57 Google Scholar
- 30.Schützenberger MP (1975) Sur certaines opérations de fermeture dans le langages rationnels. Symp Math 15:245–253 Google Scholar
- 31.Stockmeyer L, Meyer AR (1973) Word problems requiring exponential time: preliminary report. In: Fifth annual ACM symposium on theory of computing, pp 1–9 Google Scholar
- 32.Verlan S, Zizza R (2003) 1-splicing vs. 2-splicing: separating results. In: Proceedings of Words03, Turku, Finland, pp 320–331 Google Scholar
- 33.Verlan S (2004) Head systems and applications to bio-informatics. PhD thesis, University of Metz Google Scholar