Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems

DOI10.1007/978-3-642-18305-8_2zbMath1309.68068arXiv1210.5786MaRDI QIDQ3070959

Ho-Lin Chen, Ming-Yang Kao

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

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

Related Items

DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly, Graph-theoretic formalization of hybridization in DNA sticker complexes, An introduction to tile-based self-assembly and a survey of recent results, The power of duples (in self-assembly): it's not so hip to be square, Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes

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