Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Handbook of Formal Languages
DNA sequence design using templates
New Generation Computing
Codes, Involutions, and DNA Encodings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Coding properties of DNA languages
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)
Involution Solid and Join codes
Fundamenta Informaticae
DNA13'07 Proceedings of the 13th international conference on DNA computing
DNA codes and their properties
DNA'06 Proceedings of the 12th international conference on DNA Computing
Substitutions, trajectories and noisy channels
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Involution solid and join codes
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Involution Solid and Join codes
Fundamenta Informaticae
Hi-index | 0.00 |
The input data for DNA computing must be encoded into the form of single or double DNA strands. As complementary parts of single strands can bind together forming a double-stranded DNA sequence, one has to impose restrictions on these sets of DNA words (=languages) to prevent them from interacting in undesirable ways. We recall a list of known properties of DNA languages which are free of certain types of undesirable bonds. Then we introduce a general framework in which we can characterize each of these properties by a solution of a uniform formal language inequation. This characterization allows us among others to construct (i) a uniform algorithm deciding in polynomial time whether a given DNA language possesses any of the studied properties, and (ii) in many cases also an algorithm deciding whether a given DNA language is maximal with respect to the desired property.