DNA Computing

DOI10.1007/B136914MaRDI QIDQ5492785zbMATH OpenOpenAlexFDO

Authors David Soloveichik, Erik Winfree

Publication date 19 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136914

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Complexity of Self‐Assembled Shapes
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Complexities for generalized models of self-assembly
• Complexities for Generalized Models of Self-Assembly
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(28)

• Complexity classes for self-assembling flexible tiles
• Pictures worth a thousand tiles, a geometrical programming language for self-assembly
• Identifying shapes using self-assembly
• Producibility in hierarchical self-assembly
• Computing by polymerase chain reaction
• One-dimensional staged self-assembly
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• Identifying shapes using self-assembly (extended abstract)
• One-dimensional staged self-assembly
• Self-assembly of arbitrary shapes using RNAse enzymes: meeting the Kolmogorov bound with small scale factor (extended abstract)
• A brief tour of theoretical tile self-assembly
• Computability and Complexity in Self-assembly
• Transformations and Preservation of Self-assembly Dynamics through Homotheties
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
• scientific article; zbMATH DE number 6846397 (Why is no real title available?)
• A study on complexity measure of diamond tile self-assembly system
• scientific article; zbMATH DE number 7298599 (Why is no real title available?)
• Exploring 2D Shape Complexity
• Complexities for Generalized Models of Self-Assembly
• Computability and complexity in self-assembly
• Complexity of Self‐Assembled Shapes
• Complexity of graph self-assembly in accretive systems and self-destructible systems
• Local culprits of shape complexity
• Nondeterministic polynomial time factoring in the tile assembly model
• Solving NP-complete problems in the tile assembly model
• On the complexity of graph self-assembly in accretive systems
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues

This page was built for publication: DNA Computing

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