Combinatorial aspects of minimal DNA expressions

Authors:
Rudy van Vliet;Hendrik Jan Hoogeboom;Grzegorz Rozenberg
Affiliations:
Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands;Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands;Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands
Venue:
DNA'04 Proceedings of the 10th international conference on DNA computing
Year:
2004

Citing 5
Cited 3

Molecular computation of solutions to combinatorial problems

Science
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination

Handbook of formal languages, vol. 2
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)

Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
Families of languages defined by ciliate bio-operations

Theoretical Computer Science
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Linearizer and doubler: two mappings to unify molecular computing models based on DNA complementarity

DNA'05 Proceedings of the 11th international conference on DNA Computing
Making DNA Expressions Minimal

Fundamenta Informaticae
A Minimal Normal Form for DNA Expressions

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.