DNA Computing

From MaRDI portal
Revision as of 04:06, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5494342

DOI10.1007/b136914zbMath1116.68448OpenAlexW4248466611MaRDI QIDQ5494342

Ashish Goel, Ho-Lin Chen

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




Related Items

Simple evolution of complex crystal speciesA Brief Tour of Theoretical Tile Self-AssemblyArithmetic computation in the tile assembly model: addition and multiplicationFlipping Tiles: Concentration Independent Coin Flips in Tile Self-AssemblyLeakless DNA Strand Displacement SystemsSelf-assembly of infinite structures: a surveyReducing tile complexity for the self-assembly of scaled shapes through temperature programmingTile complexity of approximate squaresNondeterministic polynomial time factoring in the tile assembly modelSolving NP-complete problems in the tile assembly modelOn the complexity of graph self-assembly in accretive systemsPlane-Filling Properties of Directed FiguresConcentration independent random number generation in tile self-assemblyDNA Sticky End Design and Assignment for Robust Algorithmic Self-assemblyDistributed agreement in tile self-assemblyPolyomino-safe DNA self-assembly via block replacementRobust self-assembly of graphsError suppression mechanisms for DNA tile self-assembly and their simulationOptimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly SystemsSelf-correcting Self-assembly: Growth Models and the Hammersley ProcessComplexity of Compact Proofreading for Self-assembled PatternsPath finding in the tile assembly modelActivatable tiles for compact robust programmable molecular assembly and other applicationsPolyomino-Safe DNA Self-assembly via Block ReplacementRobust Self-assembly of Graphs