Publication:4224903
From MaRDI portal
zbMath0919.68034MaRDI QIDQ4224903
Nadrian C. Seeman, Xiao-Ping Yang, Erik Winfree
Publication date: 17 January 1999
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
DNA algorithms for fractal construction—an application of theSInsDelPsystem, Programming in Biomolecular Computation, Graph-theoretic formalization of hybridization in DNA sticker complexes, Enumeration approach to computing chemical equilibria, A comparison of graph-theoretic DNA hybridization models, Further remarks on DNA overlap assembly, Polyominoes simulating arbitrary-neighborhood zippers and tilings, The emerging discipline of biomolecular computation in the US, Capabilities and limits of compact error resilience methods for algorithmic self-assembly, Toward minimum size self-assembled counters, Polyomino-safe DNA self-assembly via block replacement, Complexity classes for self-assembling flexible tiles, Convergence rates of Markov chains for some self-assembly and non-saturated Ising models, Pictures worth a thousand tiles, a geometrical programming language for self-assembly, Self-assembly of strings and languages, Splicing on tree-like structures, Using DNA to solve the bounded Post correspondence problem, Step-wise tile assembly with a constant number of tile types, Strand design for biomolecular computation., Identifying shapes using self-assembly, Tile complexity of approximate squares, Efficient 3-SAT algorithms in the tile assembly model, Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model, Defining Languages by Forbidding-Enforcing Systems, Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes, A Self-assembly Model of Time-Dependent Glue Strength, Complexity of Compact Proofreading for Self-assembled Patterns, Polyomino-Safe DNA Self-assembly via Block Replacement
