Space and Energy Efficient Computation with DNA Strand Displacement Systems

DOI10.1007/978-3-642-32208-2_11zbMath1372.68105OpenAlexW189169192MaRDI QIDQ5200606

Chris Thachuk, Anne Condon

Publication date: 6 November 2012

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-32208-2_11

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (15)

Deterministic function computation with chemical reaction networks ⋮ Reachability bounds for chemical reaction networks and strand displacement systems ⋮ The importance of thermodynamics for molecular systems, and the importance of molecular systems for thermodynamics ⋮ Verifying chemical reaction network implementations: a bisimulation approach ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ Theory of reaction automata: a survey ⋮ Simplifying Chemical Reaction Network Implementations with Two-Stranded DNA Building Blocks ⋮ Leaderless Deterministic Chemical Reaction Networks ⋮ Functional Analysis of Large-Scale DNA Strand Displacement Circuits ⋮ Leaderless deterministic chemical reaction networks ⋮ Unnamed Item ⋮ The computational capability of chemical reaction automata ⋮ Design of nucleic acid strands with long low-barrier folding pathways

This page was built for publication: Space and Energy Efficient Computation with DNA Strand Displacement Systems