Robust Combinatorial Circuits in Chemical Reaction Networks
From MaRDI portal
Publication:5055985
Recommendations
- Robustness of expressivity in chemical reaction networks
- Robust biomolecular finite automata
- Composable computation in discrete chemical reaction networks
- Rate-independent computation in continuous chemical reaction networks
- Composable rate-independent computation in continuous chemical reaction networks
Cites work
- Chemical implementation of neural networks and Turing machines.
- Computation with finite stochastic chemical reaction networks
- DNA Walker Circuits: Computational Potential, Design, and Verification
- Robust biomolecular finite automata
- Simulating Boolean circuits on a DNA computer
- Two-domain DNA strand displacement
Cited in
(8)- Molecular device design based on chemical reaction networks: state feedback controller, static pre-filter, addition gate control system and full-dimensional state observer
- Robust detection in leak-prone population protocols
- Chemical reaction network designs for asynchronous logic circuits
- Design principles for robust biochemical reaction networks: what works, what cannot work, and what might almost work
- On estimating derivatives of input signals in biochemistry
- Robust biomolecular finite automata
- From electric circuits to chemical networks
- Robustness of expressivity in chemical reaction networks
This page was built for publication: Robust Combinatorial Circuits in Chemical Reaction Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055985)