Step-wise tile assembly with a constant number of tile types

DOI10.1007/s11047-012-9321-1zbMath1251.68103MaRDI QIDQ1761741

Ladislav Stacho, Ján Maňuch, Christine Stoll

Publication date: 15 November 2012

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-012-9321-1

zbMATH Keywords

shape; pathwidth; self-assembly; tile complexity; search number; caterpillar decomposition; stage assembly

Mathematics Subject Classification ID

90C27: Combinatorial optimization

92D20: Protein sequences, DNA sequences

52C45: Combinatorial complexity of geometric structures

Related Items

The complexity of minimum-length path decompositions, Optimal staged self-assembly of general shapes, Self-assembly of shapes at constant scale using repulsive forces

Cites Work

• Unnamed Item
• Unnamed Item
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Monotony properties of connected visible graph searching
• Interval graphs and searching
• Searching and pebbling
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• Step-Assembly with a Constant Number of Tile Types
• Complexities for Generalized Models of Self-Assembly