Recombinant DNA, gene splicing as generative devices of formal languages

Lecture Notes in Computer Science

Volumn 3526, Issue , 2005, Pages 65-67

  Bonizzoni, Paola ^a   De Felice, Clelia ^b   Mauri, Giancarlo ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GENE SPLICING; RECOMBINANT DNA;

FORMAL LANGUAGES;

EID: 26444593396     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494645_8     Document Type: Conference Paper

References (29)

1. J. Berstel, D. Perrin (1985), Theory of Codes, Academic Press, New York.
2. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza (2004), Linear splicing and syntactic monoid, submitted.
3. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza (2003), Decision problems on linear and circular splicing, in "Proc. DLT 2002" (M. Ito, M. Toyama, eds.), Lecture Notes in Computer Science, Vol. 2450, pp. 78 - 92, Springer-Verlag.
4. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza (2003), Regular languages generated by reflexive finite linear splicing systems, in "Proc. DLT 2003" (Z. Èsik, Z. Fülöp, eds.), Lecture Notes in Computer Science, Vol. 2710, pp. 134-145, Springer-Verlag.
5. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza (2001), DNA and circular splicing, in: "Proc. DNA 2000" (A. Condon, G. Rozenberg, eds.), Lecture Notes in Computer Science, Vol. 2054, 117 - 129.
6. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza (2004), Circular splicing and regularity, Theoretical Informatics and Appl. 38, 189 - 228.
7. P. Bonizzoni, G. De Felice, G. Mauri, R. Zizza (2004), On the power of circular splicing, submitted.
8. P. Bonizzoni, C. De Felice, R. Zizza (2004), The structure of reflexive regular splicing languages via Schützenberger constants, Theoretical Computer Science, to appear.
9. P. Bonizzoni, C. Ferretti, G. Mauri, R. Zizza (2001), Separating some splicing models, Information Processing Letters 76 (6), pp. 255 - 259.
10. P. Bonizzoni, G. Mauri (2004), Regular splicing languages and subclasses, Theoretical Computer Science, to appear.
11. K. Culik, T. Harju (1991), Splicing semigroups of dominoes and DNA, Discrete Applied Math. 31, pp. 261 - 277.
12. I. Fagnot (2004), Splicing Systems and Chomsky hierarchy, in "Proc. of Journees Montoises 2004" (Lieges, Belgium).
13. E. Goode Laun (1999), Constants and splicing systems, PHD Thesis, Binghamton University.
14. E. Goode, D. Pixton (2004), Recognizing splicing languages: syntactic monoids and simultaneous pumping, submitted (available from http://www.math. binghamton.edu/dennis/Papers/index.html).
15. T. Head (1987), Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours, Bull. Math. Biol. 49, pp. 737 - 759.
16. T. Head (1998), Splicing languages generated with one sided context, in "Computing with bio-molecules: theory and experiments" (Gh. Paun, Ed.), Springer-Verlag.
17. T. Head, Gh. Paun, D. Pixton (1996), Language theory and molecular genetics: generative mechanisms suggested by DNA recombination, in "Handbook of Formal Languages" (G. Rozenberg, A. Salomaa, eds.), Vol. 2, pp. 295 - 360, Springer-Verlag.
18. M. A. Harrison (1978), Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass.
19. J. E. Hopcroft, R. Motwani, J.D. Ullman (2001), Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass.
20. S.M. Kim (1997), An algorithm for identifying spliced languages, in "Proc. of Cocoon 97", Lecture Notes in Computer Science 1276, pp. 403 - 411.
21. S.M. Kim (1997), Computational modeling for genetic splicing systems, SIAM Journal of Computing 26, pp. 1284 - 1309.
22. R. McNaughton, S. Papert (1971), Counter-Free Automata, MIT Press, Cambridge, Mass.
23. Gh. Paun (1996), On the splicing operation, Discrete Applied Math. 70, pp. 57-79.
24. Gh. Paun, G. Rozenberg, A. Salomaa (1998), DNA computing, New Computing Paradigms, Springer-Verlag.
25. D. Perrin (1990), Finite Automata, in "Handbook of Theoretical Computer Science" (J. Van Leeuwen, Ed.), Vol. B, pp. 1 - 57, Elsevier.
26. D. Pixton (1996), Linear and circular splicing systems, in "Proc. of 1st Int. Symp. on Intelligence in Neural and Biological Systems", IEEE Computer Society Press, pp. 181 - 188, Silver Spring.
27. D. Pixton (1996), Regularity of splicing languages, Discrete Applied Math. 69, pp. 101 - 124.
28. M. P. Schützenberger (1975), Sur certaines opérations de fermeture dans les langages rationnels, Symposia Mathematica 15, pp. 245 - 253.
29. S. Verlan, R. Zizza (2003), 1-splicing vs. 2-splicing: separating results, in "Proc. of Words 03" (Turku, Finland, 2003), pp. 320 - 331.