Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly

DOI10.1007/978-3-642-32208-2_5zbMath1372.68097OpenAlexW2255165701MaRDI QIDQ5200598

Eugen Czeizler, Alexandru Popa

Publication date: 6 November 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32208-2_5

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)

Search methods for tile sets in patterned DNA self-assembly ⋮ 3-Color Bounded Patterned Self-assembly ⋮ 3-color bounded patterned self-assembly ⋮ One-dimensional staged self-assembly ⋮ An introduction to tile-based self-assembly and a survey of recent results

This page was built for publication: Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly