Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly

DOI10.1007/978-3-642-23638-9_13zbMath1347.68140DBLPconf/dna/LempiainenCO11OpenAlexW21952086WikidataQ58179411 ScholiaQ58179411MaRDI QIDQ3092339

Pekka Orponen, Eugen Czeizler, Tuomo Lempiäinen

Publication date: 16 September 2011

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-23638-9_13

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)

Related Items (3)

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 ⋮ An introduction to tile-based self-assembly and a survey of recent results

Uses Software

• Smodels

Cites Work

• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Algorithm portfolios

This page was built for publication: Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly