Automated analysis of tethered DNA nanostructures using constraint solving

DOI10.1007/s11047-018-9693-yzbMath1528.68121OpenAlexW2810989716WikidataQ129612215 ScholiaQ129612215MaRDI QIDQ6062022

Matthew R. Lakin, Andrew Phillips

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-018-9693-y

zbMATH Keywords

molecular computingmolecular geometryDNA strand displacementtethered DNA nanostructures

Mathematics Subject Classification ID

Biophysics (92C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• A strand graph semantics for DNA-based computation
• Automated, constraint-based analysis of tethered DNA nanostructures
• A general-purpose CRN-to-DSD compiler with formal verification, optimization, and simulation capabilities
• Solving Non-linear Arithmetic
• Abstract Modelling of Tethered DNA Circuits

This page was built for publication: Automated analysis of tethered DNA nanostructures using constraint solving