Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly

DOI10.1007/978-3-642-18305-8_7zbMath1309.68210arXiv0911.2924OpenAlexW1566329691MaRDI QIDQ3070963

Pekka Orponen, Mika Göös

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/0911.2924

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (11)

Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly ⋮ Search methods for tile sets in patterned DNA self-assembly ⋮ Design automation of polyomino set that self-assembles into a desired shape ⋮ 3-Color Bounded Patterned Self-assembly ⋮ 3-color bounded patterned self-assembly ⋮ 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 Complexity of Fixed-Height Patterned Tile Self-assembly ⋮ One-dimensional staged self-assembly ⋮ An introduction to tile-based self-assembly and a survey of recent results

Cites Work

• Strict self-assembly of discrete Sierpinski triangles
• Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly

This page was built for publication: Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly