The power of duples (in self-assembly): it's not so hip to be square
From MaRDI portal
Publication:1659998
DOI10.1016/j.tcs.2015.12.008zbMath1398.68162OpenAlexW2964122924MaRDI QIDQ1659998
Matthew J. Patitz, Jacob Hendricks, Scott M. Summers, Trent A. Rogers
Publication date: 23 August 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.008
Related Items
Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D, Building squares with optimal state complexity in restricted active self-assembly, The need for seed (in the abstract Tile Assembly Model)
Cites Work
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Computability and complexity in self-assembly
- Self-assembly of decidable sets
- Limitations of self-assembly at temperature 1
- Strict self-assembly of discrete Sierpinski triangles
- Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles
- Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems
- Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
- The program-size complexity of self-assembled squares (extended abstract)
- Running time and program size for self-assembled squares
- Turing Universality of Step-Wise and Stage Assembly at Temperature 1
- Complexities for Generalized Models of Self-Assembly
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
- Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
- Intrinsic universality in tile self-assembly requires cooperation
- Complexity of Self‐Assembled Shapes
- DNA Computing
- DNA Computing
