Abstract
We describe a formal language/notation for DNA molecules that may contain nicks and gaps. The elements of the language, DNA expressions, denote formal DNA molecules. Different DNA expressions may denote the same formal DNA molecule. We analyse the shortest DNA expressions denoting a given formal DNA molecule: what is their length, how are they constructed, how many of them are there, and how can they be characterized.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Boneh, D., Dunworth, C., Lipton, R.J.: Breaking DES using a molecular computer. In: Lipton, R.J., Baum, E.B. (eds.) DNA based computers – Proceedings of a DIMACS workshop, pp. 37–66. American Mathematical Society, Providence, RI (1996)
Chen, J., Reif, J. (eds.): DNA 2003. LNCS, vol. 2943. Springer, Heidelberg (2004)
Daley, M., Kari, L., McQuillan, I.: Families of languages defined by ciliate bio-operations. Theoretical Computer Science 320(1), 51–69 (2004)
Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D.M., Rozenberg, G.: Computation in living cells – Gene assembly in ciliates. Springer, Berlin (2004)
Hagiya, M., Ohuchi, A. (eds.): DNA 2002. LNCS, vol. 2568. Springer, Heidelberg (2003)
Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology 49(6), 737–759 (1987)
Head, T., Păun, Gh., Pixton, D.: Language theory and molecular genetics: generative mechanisms suggested by DNA recombination. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, vol. 2, pp. 295–360. Springer, Berlin (1997)
Kari, L., Păun, G., Salomaa, A.: The power of restricted splicing with rules from a regular language. Journal of Universal Computer Science 2(4), 224–240 (1996)
Landweber, L.F., Kari, L.: The evolution of cellular computing: nature’s solution to a computational problem. Proceedings of the fourth international meeting on DNA based computers, BioSystems 52, 3–13 (1999)
Li, Z.: Algebraic properties of DNA operations. Proceedings of the fourth international meeting on DNA based computers, BioSystems 52, 55–61 (1999)
Păun, G., Rozenberg, G., Salomaa, A.: DNA computing – New computing paradigms. Springer, Berlin (1998)
Stanley, R.P.: Enumerative combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)
van Vliet, R.: Combinatorial aspects of minimal DNA expressions (ext.), Technical Report 2004-03, Leiden Institute of Advanced Computer Science, Leiden University (2004), www.liacs.nl/home/rvvliet/mindnaexpr.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Vliet, R., Hoogeboom, H.J., Rozenberg, G. (2005). Combinatorial Aspects of Minimal DNA Expressions. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_33
Download citation
DOI: https://doi.org/10.1007/11493785_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)