Polyomino-Safe DNA Self-assembly via Block Replacement

DOI10.1007/978-3-642-03076-5_10zbMath1258.68060MaRDI QIDQ3643097

Chris Luhrs

Publication date: 10 November 2009

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03076-5_10

Mathematics Subject Classification ID

05B50: Polyominoes

Related Items

Unnamed Item, Parallelism and Time in Hierarchical Self-Assembly, Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals, An introduction to tile-based self-assembly and a survey of recent results, The two-handed tile assembly model is not intrinsically universal, Optimal program-size complexity for self-assembled squares at temperature 1 in 3D, Optimal self-assembly of finite shapes at temperature 1 in 3D, Identifying shapes using self-assembly, Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems, Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers
• The program-size complexity of self-assembled squares (extended abstract)
• Complexity of Compact Proofreading for Self-assembled Patterns
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
• DNA Computing
• DNA Computing
• DNA Computing