Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems
From MaRDI portal
Publication:3070959
DOI10.1007/978-3-642-18305-8_2zbMath1309.68068arXiv1210.5786OpenAlexW1880014441MaRDI QIDQ3070959
Publication date: 28 January 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.5786
Related Items (5)
The power of duples (in self-assembly): it's not so hip to be square ⋮ DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly ⋮ Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes ⋮ An introduction to tile-based self-assembly and a survey of recent results
Cites Work
- Unnamed Item
- Unnamed Item
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Reducing tile complexity for self-assembly through temperature programming
- Programmable Control of Nucleation for Algorithmic Self-Assembly
- Randomized Self-Assembly for Exact Shapes
- Running time and program size for self-assembled squares
- Complexity of Self‐Assembled Shapes
- DNA Computing
- DNA Computing
- DNA Computing
This page was built for publication: Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems
