Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems
From MaRDI portal
Publication:5200597
DOI10.1007/978-3-642-32208-2_4zbMath1330.68072OpenAlexW1895520507MaRDI QIDQ5200597
Anne Condon, Ján Maňuch, Bonnie Kirkpatrick
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_4
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40)
Related Items (7)
Deterministic function computation with chemical reaction networks ⋮ Modular verification of chemical reaction network encodings via serializability analysis ⋮ Leaderless Deterministic Chemical Reaction Networks ⋮ Modular Verification of DNA Strand Displacement Networks via Serializability Analysis ⋮ Functional Analysis of Large-Scale DNA Strand Displacement Circuits ⋮ Leaderless deterministic chemical reaction networks ⋮ Emulating cellular automata in chemical reaction-diffusion networks
This page was built for publication: Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems
