Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Handbook of Formal Languages
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
On properties of bond-free DNA languages
Theoretical Computer Science
Theoretical and Experimental DNA Computation (Natural Computing Series)
Theoretical and Experimental DNA Computation (Natural Computing Series)
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
On codes defined by bio-operations
Theoretical Computer Science
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
Hairpin structures defined by DNA trajectories
DNA'06 Proceedings of the 12th international conference on DNA Computing
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
| Hi-index | 0.00 |
We consider the use of DNA trajectories to characterize DNA bond shapes. This is an extension of recent work on the bond-free properties of a language. Using an new definition of bond-freeness, we show that we can increase the types of DNA bond shapes which are expressible. This is motivated by the types of bond shapes frequently found in DNA computing. We examine the algebraic properties of sets of trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.