Publication:4224915
From MaRDI portal
zbMath0919.68044MaRDI QIDQ4224915
Max H. Garzon, Russell J. Deaton, Donald R. Franceschetti, Richard C. Murphy, S. E. Jun. Stevens
Publication date: 17 January 1999
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
On iterated hairpin completion, Bounded hairpin completion, A series of algorithmic results related to the iterated hairpin completion, Deciding regularity of hairpin completions of regular languages in polynomial time, Large-scale DNA memory based on the nested PCR, Two complementary operations inspired by the DNA hairpin formation: Completion and reduction, On some algorithmic problems regarding the hairpin completion, Coding properties of DNA languages., Using DNA to solve the bounded Post correspondence problem, Strand design for biomolecular computation., A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing, Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing, Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract), Hairpin Lengthening and Shortening of Regular Languages, Bounded Hairpin Completion