DNA Walker Circuits: Computational Potential, Design, and Verification

DOI10.1007/978-3-319-01928-4_3zbMath1409.68099OpenAlexW2202738889MaRDI QIDQ5168496

Chris Thachuk, Frits Dannenberg, Marta Kwiatkowska, Andrew J. Turberfield

Publication date: 7 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-01928-4_3

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Modular verification of chemical reaction network encodings via serializability analysis, Robust Combinatorial Circuits in Chemical Reaction Networks, Precise parameter synthesis for stochastic biochemical systems, On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets, Automated Design and Verification of Localized DNA Computation Circuits, Formal semantics and verification of network-based biocomputation circuits, Robust biomolecular finite automata, Chemical Reaction Network Designs for Asynchronous Logic Circuits, Computing Cumulative Rewards Using Fast Adaptive Uniformization

Uses Software

• PRISM
• APMC

Cites Work

• Efficient Turing-Universal Computation with DNA Polymers
• Localized Hybridization Circuits