Polyomino-Safe DNA Self-assembly via Block Replacement
From MaRDI portal
(Redirected from Publication:3643097)
Recommendations
Cites work
- Complexities for Generalized Models of Self-Assembly
- Complexity of Compact Proofreading for Self-assembled Patterns
- DNA Computing
- DNA Computing
- DNA Computing
- DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers
- scientific article; zbMATH DE number 5764891 (Why is no real title available?)
- scientific article; zbMATH DE number 1241374 (Why is no real title available?)
- scientific article; zbMATH DE number 1568805 (Why is no real title available?)
- Invadable self-assembly: combining robustness with efficiency
- Running time and program size for self-assembled squares
- Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
- The program-size complexity of self-assembled squares (extended abstract)
Cited in
(12)- Identifying shapes using self-assembly
- An introduction to tile-based self-assembly and a survey of recent results
- The two-handed tile assembly model is not intrinsically universal
- Exact shapes and Turing universality at temperature 1 with a single negative glue
- scientific article; zbMATH DE number 1241375 (Why is no real title available?)
- DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
- Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
- Design and Simulation of Self-repairing DNA Lattices
- Parallelism and time in hierarchical self-assembly
- Parallelism and time in hierarchical self-assembly
- Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
- Polyomino-safe DNA self-assembly via block replacement
This page was built for publication: Polyomino-Safe DNA Self-assembly via Block Replacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643097)