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)
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
Probabilistic Reasoning with an Enzyme-Driven DNA Device, Graph-theoretic formalization of hybridization in DNA sticker complexes, On the scalability of biocomputing algorithms: the case of the maximum clique problem, Growing self-organizing trees for autonomous hierarchical clustering, In some curved spaces, one can solve NP-hard problems in polynomial time, Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes, Hairpin Structures in DNA Words, A CONSTANT TIME ALGORITHM FOR DNA ADD