Search methods for tile sets in patterned DNA self-assembly

DOI10.1016/j.jcss.2013.08.003zbMath1311.68150arXiv1412.7219OpenAlexW2104435610WikidataQ58179397 ScholiaQ58179397MaRDI QIDQ395021

Tuomo Lempiäinen, Pekka Orponen, Eugen Czeizler, Mika Göös

Publication date: 28 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.7219

zbMATH Keywords

tilingstile assembly modelDNA self-assemblypattern assemblyreliable self-assemblytile set synthesis

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (3)

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

Uses Software

• Gringo
• Smodels

Cites Work

• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
• Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
• Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Programmable Control of Nucleation for Algorithmic Self-Assembly
• Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly
• Combinatorial Optimization in Pattern Assembly
• Algorithm portfolios

This page was built for publication: Search methods for tile sets in patterned DNA self-assembly