Parallelism and time in hierarchical self-assembly

MaRDI QIDQ5743467zbMATH OpenFDO

Authors Ho-Lin Chen, David Doty

Publication date 10 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=2095208

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Parallelism and time in hierarchical self-assembly
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Running time and program size for self-assembled squares
• Program size and temperature in self-assembly
• Program size and temperature in self-assembly

Cites work

• Combinatorial optimization problems in self-assembly
• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes
• DNA Computing
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1342108 (Why is no real title available?)
• scientific article; zbMATH DE number 2152822 (Why is no real title available?)
• scientific article; zbMATH DE number 3222108 (Why is no real title available?)
• Polyomino-Safe DNA Self-assembly via Block Replacement
• Randomized Self-assembly for Approximate Shapes
• Randomized self-assembly for exact shapes
• Reducing tile complexity for self-assembly through temperature programming
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Running time and program size for self-assembled squares
• Self-assembly of arbitrary shapes using RNAse enzymes: meeting the Kolmogorov bound with small scale factor (extended abstract)
• Self-assembly with geometric tiles
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Shape replication through self-assembly and RNase enzymes
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Step-assembly with a constant number of tile types
• The power of nondeterminism in self-assembly
• The program-size complexity of self-assembled squares (extended abstract)
• The Tile Complexity of Linear Assemblies

Cited in

(19)

• Optimal staged self-assembly of general shapes
• Nearly constant tile complexity for any shape in two-handed tile assembly
• Producibility in hierarchical self-assembly
• Parallel computation using active self-assembly
• Activatable tiles for compact robust programmable molecular assembly and other applications
• An introduction to tile-based self-assembly and a survey of recent results
• The two-handed tile assembly model is not intrinsically universal
• Time complexity of computation and construction in the chemical reaction network-controlled tile assembly model
• Producibility in hierarchical self-assembly
• Pattern overlap implies runaway growth in hierarchical tile systems
• Strict self-assembly of fractals using multiple hands
• A Limit to the Power of Multiple Nucleation in Self-assembly
• Parallel Computation Using Active Self-assembly
• Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
• Pattern overlap implies runaway growth in hierarchical tile systems
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Parallelism and time in hierarchical self-assembly
• Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
• Optimal staged self-assembly of linear assemblies

This page was built for publication: Parallelism and time in hierarchical self-assembly

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