One-dimensional staged self-assembly

DOI10.1007/s11047-012-9359-0zbMath1331.68076OpenAlexW2077375444MaRDI QIDQ256717

Erik D. Demaine, Sarah Eisenstat, Andrew Winslow, Mashhood Ishaque

Publication date: 10 March 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-012-9359-0

zbMATH Keywords

complexityDNA computingcontext-free grammarWang tile

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items

Optimal staged self-assembly of general shapes, Staged self-assembly and polyomino context-free grammars, Optimal staged self-assembly of linear assemblies, An introduction to tile-based self-assembly and a survey of recent results

Cites Work

• Unnamed Item
• Unnamed Item
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• String matching in Lempel-Ziv compressed strings
• A fully linear-time approximation algorithm for grammar-based compression
• Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
• Randomized Self-assembly for Approximate Shapes
• Approximating the smallest grammar
• The Tile Complexity of Linear Assemblies
• Universal lossless compression via multilevel pattern matching
• Synthesizing Minimal Tile Sets for Complex Patterns in the Framework of Patterned DNA Self-Assembly
• DNA Computing