Synthesizing and Tuning Chemical Reaction Networks with Specified Behaviours

DOI10.1007/978-3-319-21999-8_2zbMath1403.92356arXiv1508.04403OpenAlexW3106052164MaRDI QIDQ2948406

Rasmus L. Petersen, Niall Murphy, Neil Dalchau, Boyan Yordanov

Publication date: 30 September 2015

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

Full work available at URL: https://arxiv.org/abs/1508.04403

zbMATH Keywords

Markov chain Monte Carloprogram synthesischemical reaction networkssatisfiability modulo theorieschemical master equationparameter optimisation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Classical flows, reactions, etc. in chemistry (92E20) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Logic programming (68N17)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A simple population protocol for fast robust approximate majority
• Computation in networks of passively mobile finite-state sensors
• Fast Computation by Population Protocols with a Leader
• Markov Chains
• Determining Majority in Networks with Local Interactions and Very Small Local Memory
• Functional Analysis of Large-Scale DNA Strand Displacement Circuits
• Stably computable predicates are semilinear
• Deterministic Function Computation with Chemical Reaction Networks

This page was built for publication: Synthesizing and Tuning Chemical Reaction Networks with Specified Behaviours