The following pages link to Matthew R. Lakin (Q288809):
Displaying 17 items.
- Modular verification of chemical reaction network encodings via serializability analysis (Q288812) (← links)
- A strand graph semantics for DNA-based computation (Q288814) (← links)
- Stochastic simulation of multiple process calculi for biology (Q418846) (← links)
- Automated, constraint-based analysis of tethered DNA nanostructures (Q1694407) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- Towards temporal logic computation using DNA strand displacement reactions (Q2400945) (← links)
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
- Abstract Modelling of Tethered DNA Circuits (Q2921478) (← links)
- Pattern Formation by Spatially Organized Approximate Majority Reactions (Q2945542) (← links)
- Supervised Learning in an Adaptive DNA Strand Displacement Circuit (Q2948414) (← links)
- Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems (Q3092338) (← links)
- Constraint solving in non-permutative nominal abstract syntax (Q3224672) (← links)
- Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming (Q3617690) (← links)
- Towards a Biomolecular Learning Machine (Q4648200) (← links)
- DNA Reservoir Computing: A Novel Molecular Computing Approach (Q5168500) (← links)
- Modular Verification of DNA Strand Displacement Networks via Serializability Analysis (Q5168504) (← links)
- Automated analysis of tethered DNA nanostructures using constraint solving (Q6062022) (← links)
