Reachability bounds for chemical reaction networks and strand displacement systems
DOI10.1007/S11047-013-9403-8zbMATH Open1334.68066DBLPjournals/nc/CondonKM14OpenAlexW2007613090WikidataQ41830728 ScholiaQ41830728MaRDI QIDQ268448FDOQ268448
Authors: Anne Condon, Bonnie Kirkpatrick, Ján Maňuch 
Publication date: 15 April 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-013-9403-8
Recommendations
Biochemistry, molecular biology (92C40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Efficient Turing-universal computation with DNA polymers
- Computation with finite stochastic chemical reaction networks
- Less haste, less waste: on recycling and its limits in strand displacement systems
- Two-domain DNA strand displacement
- Deterministic Function Computation with Chemical Reaction Networks
- Space and energy efficient computation with DNA strand displacement systems
Cited In (7)
- Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders
- Reachability bounds for chemical reaction networks and strand displacement systems
- Verifying polymer reaction networks using bisimulation
- Time complexity of computation and construction in the chemical reaction network-controlled tile assembly model
- Less haste, less waste: on recycling and its limits in strand displacement systems
- Space and energy efficient computation with DNA strand displacement systems
- Boundedness analysis for open chemical reaction networks with mass-action kinetics
This page was built for publication: Reachability bounds for chemical reaction networks and strand displacement systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q268448)
