DNA Walker Circuits: Computational Potential, Design, and Verification
From MaRDI portal
Recommendations
- DNA walker circuits: computational potential, design, and verification
- Petri-net-based 2D design of DNA walker circuits
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets
- Automated Design and Verification of Localized DNA Computation Circuits
- Functional analysis of large-scale DNA strand displacement circuits
- scientific article; zbMATH DE number 1953204
- Algorithms – ESA 2004
Cited in
(11)- DNA walker circuits: computational potential, design, and verification
- Formal semantics and verification of network-based biocomputation circuits
- Robust biomolecular finite automata
- Precise parameter synthesis for stochastic biochemical systems
- Chemical reaction network designs for asynchronous logic circuits
- Modular verification of chemical reaction network encodings via serializability analysis
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets
- Automated Design and Verification of Localized DNA Computation Circuits
- Robust Combinatorial Circuits in Chemical Reaction Networks
- Computing cumulative rewards using fast adaptive uniformization
- DNA Computing
This page was built for publication: DNA Walker Circuits: Computational Potential, Design, and Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168496)