DNA Computing
From MaRDI portal
Publication:5492785
DOI10.1007/b136914zbMath1116.68467OpenAlexW4248466611MaRDI QIDQ5492785
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
A Brief Tour of Theoretical Tile Self-Assembly ⋮ Complexity of graph self-assembly in accretive systems and self-destructible systems ⋮ Nondeterministic polynomial time factoring in the tile assembly model ⋮ Solving NP-complete problems in the tile assembly model ⋮ Transformations and Preservation of Self-assembly Dynamics through Homotheties ⋮ On the complexity of graph self-assembly in accretive systems ⋮ Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues ⋮ Computing by polymerase chain reaction ⋮ Staged self-assembly and polyomino context-free grammars ⋮ Complexity classes for self-assembling flexible tiles ⋮ Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems ⋮ Pictures worth a thousand tiles, a geometrical programming language for self-assembly ⋮ One-Dimensional Staged Self-assembly ⋮ Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes ⋮ One-dimensional staged self-assembly
This page was built for publication: DNA Computing
