scientific article; zbMATH DE number 1738639
From MaRDI portal
Publication:4529973
zbMath0984.68660MaRDI QIDQ4529973
Cliff Johnson, Paul Wilhelm Karl Rothemund, Nickolas V. Chelyapov, Darryl Hwang, Ravinderjit S. Braich
Publication date: 7 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2054/20540027
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computing methodologies and applications (68U99)
Related Items (14)
A DNA-based graph encoding scheme with its applications to graph isomorphism problems ⋮ Solving the minimum bisection problem using a biologically inspired computational model ⋮ Solving the maximum weighted clique problem based on parallel biological computing model ⋮ Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation ⋮ Arithmetic computation in the tile assembly model: addition and multiplication ⋮ Deterministic polynomial-time algorithms for designing short DNA words ⋮ Nondeterministic polynomial time factoring in the tile assembly model ⋮ Solving NP-complete problems in the tile assembly model ⋮ Computing by polymerase chain reaction ⋮ A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers ⋮ The emerging discipline of biomolecular computation in the US ⋮ Solving the maximal matching problem with DNA molecules in Adleman–Lipton model ⋮ DNA Recombination by XPCR ⋮ Strand design for biomolecular computation.
This page was built for publication:
