Efficient Turing-Universal Computation with DNA Polymers

DOI10.1007/978-3-642-18305-8_12zbMath1309.68071OpenAlexW1842664382WikidataQ59328924 ScholiaQ59328924MaRDI QIDQ3070966

Lulu Qian, David Soloveichik, Erik Winfree

Publication date: 28 January 2011

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

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20111006-081731222

Mathematics Subject Classification ID

Related Items (32)

Reachability bounds for chemical reaction networks and strand displacement systems ⋮ Modular verification of chemical reaction network encodings via serializability analysis ⋮ A strand graph semantics for DNA-based computation ⋮ Universality in Molecular and Cellular Computing ⋮ An RNA-based theory of natural universal computation ⋮ Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model ⋮ The importance of thermodynamics for molecular systems, and the importance of molecular systems for thermodynamics ⋮ Verifying chemical reaction network implementations: a bisimulation approach ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ DNAQL: a query language for DNA sticker complexes ⋮ On a model of online analog computation in the cell with absolute functional robustness: algebraic characterization, function compiler and error control ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Theory of reaction automata: a survey ⋮ Implementing Non-Equilibrium Networks with Active Circuits of Duplex Catalysts. ⋮ Simplifying Chemical Reaction Network Implementations with Two-Stranded DNA Building Blocks ⋮ Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements ⋮ DNA Walker Circuits: Computational Potential, Design, and Verification ⋮ DNA walker circuits: computational potential, design, and verification ⋮ Verifying polymer reaction networks using bisimulation ⋮ In Vitro Implementation of a Stack Data Structure Based on DNA Strand Displacement ⋮ Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes ⋮ Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems ⋮ Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems ⋮ Emulating cellular automata in chemical reaction-diffusion networks ⋮ The computational capability of chemical reaction automata ⋮ Design of nucleic acid strands with long low-barrier folding pathways ⋮ A Scheme for Molecular Computation of Maximum Likelihood Estimators for Log-Linear Models ⋮ Verifying Chemical Reaction Network Implementations: A Bisimulation Approach ⋮ Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model ⋮ A Survey on Analog Models of Computation ⋮ Algebraic biochemistry: a framework for analog online computation in cells ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes

Uses Software

• BioNetGen

Cites Work

• Unnamed Item
• Unnamed Item
• Computation with finite stochastic chemical reaction networks
• Rule-Based Modelling of Cellular Signalling
• On the Computational Power of Biochemistry
• Irreversibility and Heat Generation in the Computing Process
• Strand Algebras for DNA Computing
• Time/Space Trade-Offs for Reversible Computation
• Logical Reversibility of Computation

This page was built for publication: Efficient Turing-Universal Computation with DNA Polymers