Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly

DOI10.1016/j.tcs.2013.05.009zbMath1296.68065OpenAlexW2019096278MaRDI QIDQ391179

Eugen Czeizler, Alexandru Popa

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.009

zbMATH Keywords

NP-hardnesstile assembly modelDNA self-assemblyminimal tile setspattern assembly

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (4)

Computational modelling of the kinetic tile assembly model using a rule-based approach ⋮ A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis ⋮ Binary pattern tile set synthesis is NP-hard ⋮ The Complexity of Fixed-Height Patterned Tile Self-assembly

Cites Work

• Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
• One-Dimensional Staged Self-assembly
• Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• Running time and program size for self-assembled squares

This page was built for publication: Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly