DNA Computing

DOI10.1007/b95518zbMath1098.68597MaRDI QIDQ5717646

Erik Winfree, Matthew Cook, Paul Wilhelm Karl Rothemund

Publication date: 10 January 2006

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

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

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

Related Items

Iterative Self-assembly with Dynamic Strength Transformation and Temperature Control, A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis, Binary pattern tile set synthesis is NP-hard, Complexity of graph self-assembly in accretive systems and self-destructible systems, Error suppression mechanisms for DNA tile self-assembly and their simulation, 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, Toward minimum size self-assembled counters, Path finding in the tile assembly model, Simple evolution of complex crystal species, Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems, A Self-assembly Model of Time-Dependent Glue Strength, Complexity of Compact Proofreading for Self-assembled Patterns, Connecting the Dots: Molecular Machinery for Distributed Robotics