Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Handbook of Formal Languages
Characterizing Regular Languages with Polynomial Densities
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Trajectory-based embedding relations
Fundamenta Informaticae
On properties of bond-free 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)
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Characterizing DNA bond shapes using trajectories
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On codes defined by bio-operations
Theoretical Computer Science
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
Watson---Crick palindromes in DNA computing
Natural Computing: an international journal
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
Hi-index | 0.00 |
We examine scattered hairpins, which are structures formed when a single strand folds into a partially hybridized stem and a loop. To specify different classes of hairpins, we use the concept of DNA trajectories, which allows precise descriptions of valid bonding patterns on the stem of the hairpin. DNA trajectories have previously been used to describe bonding between separate strands. We are interested in the mathematical properties of scattered hairpins described by DNA trajectories. We examine the complexity of set of hairpin-free words described by a set of DNA trajectories. In particular, we consider the closure properties of language classes under sets of DNA trajectories of differing complexity. We address decidability of recognition problems for hairpin structures.