Strand Algebras for DNA Computing

DOI10.1007/978-3-642-10604-0_2MaRDI QIDQ3654668zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Luca Cardelli

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

Mathematics Subject Classification ID

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

Cited in

(12)

• Graph-theoretic formalization of hybridization in DNA sticker complexes
• Probabilistic reasoning with a Bayesian DNA device based on strand displacement
• Efficient Turing-universal computation with DNA polymers
• Graph-theoretic formalization of hybridization in DNA sticker complexes
• Autonomous resolution based on DNA strand displacement
• Logical inference by DNA strand algebra
• scientific article; zbMATH DE number 2087017 (Why is no real title available?)
• Autocatalysis in reaction networks
• A Survey on Analog Models of Computation
• STRING OPERATIONS SUGGESTED BY DNA BIOCHEMISTRY: THE BALANCED CUT OPERATION
• Strand algebras for DNA computing
• DNAQL: a query language for DNA sticker complexes

This page was built for publication: Strand Algebras for DNA Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3654668)