DNA Computing
From MaRDI portal
Publication:5494342
DOI10.1007/b136914zbMath1116.68448MaRDI QIDQ5494342
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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
92D20: Protein sequences, DNA sequences
Related Items
DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly, Concentration independent random number generation in tile self-assembly, Distributed agreement in tile self-assembly, Self-assembly of infinite structures: a survey, Error suppression mechanisms for DNA tile self-assembly and their simulation, Arithmetic computation in the tile assembly model: addition and multiplication, 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, Polyomino-safe DNA self-assembly via block replacement, Robust self-assembly of graphs, Path finding in the tile assembly model, Tile complexity of approximate squares, Activatable tiles for compact robust programmable molecular assembly and other applications, Reducing tile complexity for the self-assembly of scaled shapes through temperature programming, Simple evolution of complex crystal species, Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly, Leakless DNA Strand Displacement Systems, Plane-Filling Properties of Directed Figures, Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems, A Brief Tour of Theoretical Tile Self-Assembly, Self-correcting Self-assembly: Growth Models and the Hammersley Process, Complexity of Compact Proofreading for Self-assembled Patterns, Polyomino-Safe DNA Self-assembly via Block Replacement, Robust Self-assembly of Graphs
