A strand graph semantics for DNA-based computation
From MaRDI portal
DNA computingprogramming languagemolecular programmingbiological computationprocess calculussite graphstrand graph
Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Implementation of Turing machine using DNA strand displacement
- Parallel and scalable computation and spatial dynamics with DNA-based chemical reaction networks on a surface
- Automated Design and Verification of Localized DNA Computation Circuits
- Modelling, simulating and verifying Turing-powerful strand displacement systems
- Unconventional Computation
Cites work
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1738644 (Why is no real title available?)
- A Grammatical Approach to Self-Organizing Robotic Systems
- A calculus of mobile processes. I
- Abstract Interpretation of Cellular Signalling Networks
- Abstract modelling of tethered DNA circuits
- Efficient Turing-universal computation with DNA polymers
- Formal molecular biology
- Functional analysis of large-scale DNA strand displacement circuits
- Localized hybridization circuits
- Modelling, simulating and verifying Turing-powerful strand displacement systems
- Parallel and scalable computation and spatial dynamics with DNA-based chemical reaction networks on a surface
- Stochastic simulation of multiple process calculi for biology
Cited in
(4)
This page was built for publication: A strand graph semantics for DNA-based computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288814)