Abstract
Splicing schemes are formal devices which act on sets of strings in a manner that is suggested by the action of sets of restriction enzymes and a ligase on double stranded DNA molecules. Previous work on splicing systems is reviewed and problems are suggested that concern the generative capacities of splicing schemes acting on both linear and circular strings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berg,D.E.: Genomic rearrangements in prokaryotes. In: Gene Rearrangement, B.D.Hames & D.M.Glover, Eds. Oxford: Oxford Univ. Press 1990
Berstel,J.: Transductions and Context-Free Languages. Stuttgart: Teubner 1979
Culik II,K. and T.Harju: Dominoes over a free monoid. Theoretical Computer Science, 18, 279–300(1982)
Culik II,K. and T.Harju: The regularity of splicing systems and DNA. In: 16th International Colloquium on Automata Languages and Programming. Lecture Notes in Computer Science, Vol. 372,pp.222–233. Berlin-Heidelberg-New York: Springer 1989
Culik II,K. and T.Harju: Splicing semigroups of dominoes and DNA. Discrete Applied Mathematics, (to appear).
Denninghoff,K.L. and R.W.Gatterdam: On the undecidability of splicing systems. International Journal of Computer Mathematics, 27, 133–145(1989)
De Luca,A. and A.Restivo: A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup. Information and Control, 44, 300–319(1980)
Eilenberg,S.: Automata, Languages, and Machines. Vol.A. New York: Academic Press 1974
Gatterdam,R.W.: Algorithms for splicing systems. Univ. of Alaska, Math.Dept. Technical Report
Gatterdam,R.W.: Splicing systems and regularity. International Journal of Computer Mathematics, 31, 63–67(1989)
Ginsburg,S.: Algebraic and Automata-Theoretic Properties of Formal Languages. New York: North Holland/Elsevier 1975
Goldberg,D.E.: Genetic Algorithms. Reading, Mass.: Addison-Wesley 1989
Hames,B.D. and D.M.Glover,Eds.: Gene Rearrangement. Oxford: Oxford Univ. Press 1990
Head,T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology, 49, 737–759(1987)
Herman, G.T. and G. Rozenberg: Developmental Systems and Languages. New York: North Hoiland/American Elsevier 1975
Hopcroft,J.E. and J.D.Ullman: Introduction to Automata Theory, Languages, and Computation. Reading, Mass: Addison-Wesley 1979
Lewin,B.: Genes IV. New York: Oxford Univ. Press 1990
Lindenmayer,A.: Mathematical models for cellular interactions in development I,II: Journal of Theoretical Biology, 18, 280–315(1968)
McNaughton,R. and S.Papert: Counter-Free Automata. Cambridge, Mass.: MIT Press 1971
Pin,J.E.: Varieties of Formal Languages. New York: Plenum 1986
Prusinkiewicz,P. and A.Lindenmayer: The Algorithmic Beauty of Plants. New York: Springer-Verlag 1990
Rozenberg,G. and A.Salomaa: The Mathematical Theory of L-Systems. New York: Academic Press 1980
Salomaa,A.: Formal Languages. New York: Academic Press 1973
Schutzenberger,M.P.: Sur certaines operations de fermeture dans les langages rationnels. Symposia Mathematica, 15, 245–253 (1975)
Watson,J.D., J.Tooze, and D.T.Kurtz: Recombinant DNA: A Short Course. New York: Freeman 1983
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Head, T. (1992). Splicing Schemes and DNA. In: Rozenberg, G., Salomaa, A. (eds) Lindenmayer Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58117-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-58117-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63474-1
Online ISBN: 978-3-642-58117-5
eBook Packages: Springer Book Archive