Efficient Turing-universal computation with DNA polymers
From MaRDI portal
Recommendations
- Implementation of Turing machine using DNA strand displacement
- Space and energy efficient computation with DNA strand displacement systems
- Modelling, simulating and verifying Turing-powerful strand displacement systems
- Chemical implementation of neural networks and Turing machines.
- Computation with finite stochastic chemical reaction networks
Cites work
- Computation with finite stochastic chemical reaction networks
- scientific article; zbMATH DE number 1072534 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- On the Computational Power of Biochemistry
- Rule-Based Modelling of Cellular Signalling
- Strand Algebras for DNA Computing
- Time/Space Trade-Offs for Reversible Computation
Cited in
(39)- Theory of reaction automata: a survey
- Implementation of Turing machine using DNA strand displacement
- DNA walker circuits: computational potential, design, and verification
- Verifying polymer reaction networks using bisimulation
- Algebraic biochemistry: a framework for analog online computation in cells
- 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
- Verifying chemical reaction network implementations: a bisimulation approach
- Verifying chemical reaction network implementations: a pathway decomposition approach
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- An RNA-based theory of natural universal computation
- Reachability bounds for chemical reaction networks and strand displacement systems
- In vitro implementation of a stack data structure based on DNA strand displacement
- 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
- Logically and physically reversible natural computing: a tutorial
- Modular verification of chemical reaction network encodings via serializability analysis
- A strand graph semantics for DNA-based computation
- Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model
- 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
- Universality in Molecular and Cellular Computing
- A Survey on Analog Models of Computation
- The computing power of determinism and reversibility in chemical reaction automata
- DNA Walker Circuits: Computational Potential, Design, and Verification
- Space and energy efficient computation with DNA strand displacement systems
- The importance of thermodynamics for molecular systems, and the importance of molecular systems for thermodynamics
- Simplifying Chemical Reaction Network Implementations with Two-Stranded DNA Building Blocks
- Implementing Non-Equilibrium Networks with Active Circuits of Duplex Catalysts.
- 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
- Message complexity of population protocols
- Chemical mass-action systems as analog computers: implementing arithmetic computations at specified speed
- Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
- Maximum likelihood estimation of log-affine models using detailed-balanced reaction networks
- On BIOCHAM symbolic computation pipeline for compiling mathematical functions into biochemistry
This page was built for publication: Efficient Turing-universal computation with DNA polymers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070966)
