Pages that link to "Item:Q3070966"

The following pages link to Efficient Turing-Universal Computation with DNA Polymers (Q3070966):

Displaying 32 items.

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