A strand graph semantics for DNA-based computation

DOI10.1016/j.tcs.2015.07.041zbMath1339.68084DBLPjournals/tcs/PetersenLP16OpenAlexW1148033823WikidataQ36977561 ScholiaQ36977561MaRDI QIDQ288814

Matthew R. Lakin, Andrew Phillips, Rasmus L. Petersen

Publication date: 27 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.041

zbMATH Keywords

DNA computingprogramming languagemolecular programmingbiological computationprocess calculussite graphstrand graph

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Automated analysis of tethered DNA nanostructures using constraint solving

Uses Software

• PRISM
• Visual DSD

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic simulation of multiple process calculi for biology
• A calculus of mobile processes. I
• Formal molecular biology
• Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface
• Abstract Modelling of Tethered DNA Circuits
• Efficient Turing-Universal Computation with DNA Polymers
• Localized Hybridization Circuits
• Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
• Functional Analysis of Large-Scale DNA Strand Displacement Circuits
• A Grammatical Approach to Self-Organizing Robotic Systems
• Abstract Interpretation of Cellular Signalling Networks

This page was built for publication: A strand graph semantics for DNA-based computation