Self-assembly of patterns in the abstract tile assembly model

DOI10.1007/978-3-031-63742-1_7MaRDI QIDQ7013626zbMATH OpenFDO

Authors Phillip Drake, Matthew J. Patitz, Scott M. Summers, Tyler Tracy

Publication date 12 March 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63742-1_7

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• Binary pattern tile set synthesis is NP-hard
• Complexity of Self‐Assembled Shapes
• Computability and complexity in self-assembly
• Running time and program size for self-assembled squares
• Self-assembly of decidable sets
• Self-assembly of patterns in the abstract tile assembly model
• Strict self-assembly of discrete Sierpinski triangles
• Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
• Synthesizing small and reliable tile sets for patterned DNA self-assembly
• The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Universality in the abstract Tile Assembly Model
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(1)

• Self-assembly of patterns in the abstract tile assembly model

This page was built for publication: Self-assembly of patterns in the abstract tile assembly model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013626)