Strand Algebras for DNA Computing
From MaRDI portal
Publication:3654668
DOI10.1007/978-3-642-10604-0_2zbMath1273.68113DBLPconf/dna/Cardelli09OpenAlexW1652394668WikidataQ56981991 ScholiaQ56981991MaRDI QIDQ3654668
Publication date: 7 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10604-0_2
Related Items (10)
Probabilistic reasoning with a Bayesian DNA device based on strand displacement ⋮ DNAQL: a query language for DNA sticker complexes ⋮ Logical Inference by DNA Strand Algebra ⋮ Autocatalysis in reaction networks ⋮ Strand algebras for DNA computing ⋮ Efficient Turing-Universal Computation with DNA Polymers ⋮ Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes ⋮ Autonomous Resolution Based on DNA Strand Displacement ⋮ A Survey on Analog Models of Computation ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes
This page was built for publication: Strand Algebras for DNA Computing
