Theoretical and experimental DNA computation.
From MaRDI portal
Publication:1773220
zbMath1075.68031MaRDI QIDQ1773220
Publication date: 26 April 2005
Published in: Natural Computing Series (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (11)
In some curved spaces, one can solve NP-hard problems in polynomial time ⋮ DNAQL: a query language for DNA sticker complexes ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ On the scalability of biocomputing algorithms: the case of the maximum clique problem ⋮ Growing self-organizing trees for autonomous hierarchical clustering ⋮ Probabilistic Reasoning with an Enzyme-Driven DNA Device ⋮ Hairpin Structures in DNA Words ⋮ A CONSTANT TIME ALGORITHM FOR DNA ADD ⋮ Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes ⋮ Anti-heterotic Computing ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes
This page was built for publication: Theoretical and experimental DNA computation.
