3-Color Bounded Patterned Self-assembly

DOI10.1007/978-3-319-01928-4_8zbMath1414.68030OpenAlexW2192545815MaRDI QIDQ5168502

Lila Kari, Steffen Kopecki, Shinnosuke Seki

Publication date: 7 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-01928-4_8

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY ⋮ A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis ⋮ Binary pattern tile set synthesis is NP-hard ⋮ 3-Color Bounded Patterned Self-assembly ⋮ 3-color bounded patterned self-assembly

Cites Work

• Unnamed Item
• Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
• The program-size complexity of self-assembled squares (extended abstract)
• 3-Color Bounded Patterned Self-assembly
• Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly
• Combinatorial Optimization in Pattern Assembly

This page was built for publication: 3-Color Bounded Patterned Self-assembly