DNA Computing
From MaRDI portal
Recommendations
Cited in
(41)- Path finding in the tile assembly model
- Pictures worth a thousand tiles, a geometrical programming language for self-assembly
- Optimizing tile set size while preserving proofreading with a DNA self-assembly compiler
- The power of duples (in self-assembly): it's not so hip to be square
- 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
- An introduction to tile-based self-assembly and a survey of recent results
- Simple evolution of complex crystal species
- Efficient 3-SAT algorithms in the tile assembly model
- Exploring programmable self-assembly in non-DNA based molecular computing
- Leakless DNA strand displacement systems
- Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
- A brief tour of theoretical tile self-assembly
- Strict self-assembly of fractals using multiple hands
- Transformations and Preservation of Self-assembly Dynamics through Homotheties
- Self-correcting Self-assembly: Growth Models and the Hammersley Process
- 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
- Polyomino-Safe DNA Self-assembly via Block Replacement
- Robust Self-assembly of Graphs
- The effect of malformed tiles on tile assemblies within kTAM
- DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
- Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions
- DNA Computing
- DNA Computing
- Parallelism and time in hierarchical self-assembly
- Design automation of polyomino set that self-assembles into a desired shape
- Self-assembly of infinite structures: a survey
- Complexity of graph self-assembly in accretive systems and self-destructible systems
- Error suppression mechanisms for DNA tile self-assembly and their simulation
- Capabilities and limits of compact error resilience methods for algorithmic self-assembly
- 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
- Toward minimum size self-assembled counters
- Polyomino-safe DNA self-assembly via block replacement
- Robust self-assembly of graphs
This page was built for publication: DNA Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717650)