scientific article; zbMATH DE number 1241377

zbMath0919.68044MaRDI QIDQ4224915

Donald R. Franceschetti, S. E. Jun. Stevens, Richard C. Murphy, Russell J. Deaton, Max H. Garzon

Publication date: 17 January 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian path problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (16)

Hairpin Lengthening and Shortening of Regular Languages ⋮ A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing ⋮ A series of algorithmic results related to the iterated hairpin completion ⋮ Hairpin completions and reductions: semilinearity properties ⋮ Coding properties of DNA languages. ⋮ Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing ⋮ Large-scale DNA memory based on the nested PCR ⋮ On iterated hairpin completion ⋮ Bounded hairpin completion ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time ⋮ Two complementary operations inspired by the DNA hairpin formation: Completion and reduction ⋮ Bounded Hairpin Completion ⋮ Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) ⋮ On some algorithmic problems regarding the hairpin completion ⋮ Using DNA to solve the bounded Post correspondence problem ⋮ Strand design for biomolecular computation.

This page was built for publication: