Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
From MaRDI portal
Publication:3092335
DOI10.1007/978-3-642-23638-9_9zbMath1347.68132OpenAlexW2100383275MaRDI QIDQ3092335
Ján Maňuch, Alan Hu, Chris Thachuk, Anne Condon
Publication date: 16 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23638-9_9
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)
Related Items (8)
Deterministic function computation with chemical reaction networks ⋮ Reachability bounds for chemical reaction networks and strand displacement systems ⋮ Speed faults in computation by chemical reaction networks ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ Simplifying Chemical Reaction Network Implementations with Two-Stranded DNA Building Blocks ⋮ Leaderless Deterministic Chemical Reaction Networks ⋮ Leaderless deterministic chemical reaction networks ⋮ Design of nucleic acid strands with long low-barrier folding pathways
Cites Work
- Unnamed Item
- Strand algebras for DNA computing
- Negative interactions in irreversible self-assembly
- Efficient Turing-Universal Computation with DNA Polymers
- The program-size complexity of self-assembled squares (extended abstract)
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
- A Survey of Combinatorial Gray Codes
- Asymptotically good codes correcting insertions, deletions, and transpositions
This page was built for publication: Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems