The following pages link to DNA Computing (Q5492785):
Displaying 15 items.
- One-dimensional staged self-assembly (Q256717) (← links)
- Complexity of graph self-assembly in accretive systems and self-destructible systems (Q633697) (← links)
- Nondeterministic polynomial time factoring in the tile assembly model (Q924676) (← links)
- Solving NP-complete problems in the tile assembly model (Q924678) (← links)
- On the complexity of graph self-assembly in accretive systems (Q934978) (← links)
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues (Q941687) (← links)
- Complexity classes for self-assembling flexible tiles (Q1004079) (← links)
- Pictures worth a thousand tiles, a geometrical programming language for self-assembly (Q1013126) (← links)
- Staged self-assembly and polyomino context-free grammars (Q2003475) (← links)
- Computing by polymerase chain reaction (Q2476101) (← links)
- One-Dimensional Staged Self-assembly (Q3092336) (← links)
- A Brief Tour of Theoretical Tile Self-Assembly (Q3186470) (← links)
- Transformations and Preservation of Self-assembly Dynamics through Homotheties (Q3540101) (← links)
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems (Q3618692) (← links)
- Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes (Q3643099) (← links)
