One-dimensional staged self-assembly
From MaRDI portal
Recommendations
Cites work
- A fully linear-time approximation algorithm for grammar-based compression
- Approximating the smallest grammar
- DNA Computing
- scientific article; zbMATH DE number 2087040 (Why is no real title available?)
- scientific article; zbMATH DE number 2119662 (Why is no real title available?)
- Randomized Self-assembly for Approximate Shapes
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- String matching in Lempel-Ziv compressed strings
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
- The Tile Complexity of Linear Assemblies
- Universal lossless compression via multilevel pattern matching
Cited in
(6)- Optimal staged self-assembly of general shapes
- Optimal staged self-assembly of linear assemblies
- An introduction to tile-based self-assembly and a survey of recent results
- One-dimensional staged self-assembly
- Optimal staged self-assembly of linear assemblies
- Reachability in interactive chemical reaction networks
This page was built for publication: One-dimensional staged self-assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256717)