Related papers: Algorithmic Self-Assembly of DNA Tiles and its App…
In recent years there have been a number of proposals to utilize the specificity of DNA based interactions for potential applications in nanoscience. One interesting direction is the self-assembly of micro- and nanoparticle clusters using…
Algorithmic self-assembly occurs when disorganized components autonomously combine to form structures and, by their design and the dynamics of the system, are forced to follow the execution of algorithms. Motivated by applications in…
Branched molecules of deoxyribonucleic acid (DNA) can self-assemble into nanostructures through complementary cohesive strand base pairing. The production of DNA nanostructures is valuable in targeted drug delivery and biomolecular…
The Pattern self-Assembly Tile set Synthesis (PATS) problem, which arises in the theory of structured DNA self-assembly, is to determine a set of coloured tiles that, starting from a bordering seed structure, self-assembles to a given…
Tile assembly systems in the abstract Tile Assembly Model (aTAM) are computationally universal and capable of building complex shapes, but DNA-based implementations encounter formidable error rates that stifle this theoretical potential.…
We study the problem of the self-assembly of nanoparticles (NPs) into finite mesoscopic structures with a programmed local morphology and complex overall shape. Our proposed building blocks are NPs directionally-functionalized with DNA. The…
The Pattern self-Assembly Tile set Synthesis (PATS) problem is to determine a set of coloured tiles that self-assemble to implement a given rectangular colour pattern. We give an exhaustive branch-and-bound algorithm to find tile sets of…
We show the first non-trivial positive algorithmic results (i.e. programs whose output is larger than their size), in a model of self-assembly that has so far resisted many attempts of formal analysis or programming: the planar…
We ask the question of how small a self-assembling set of tiles can be yet have interesting computational behaviour. We study this question in a model where supporting walls are provided as an input structure for tiles to grow along: we…
We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material) and one operation that destroys all…
The field of complex self-assembly is moving toward the design of multi-particle structures consisting of thousands of distinct building blocks. To exploit the potential benefits of structures with such `addressable complexity,' we need to…
Self-assembly is one of the most promising strategies for making functional materials at the nanoscale, yet new design principles for making self-limiting architectures, rather than spatially unlimited periodic lattice structures, are…
We study DNA self-assembly and DNA computation using a coarse-grained DNA model within the directional dynamic bonding framework {[}C. Svaneborg, Comp. Phys. Comm. 183, 1793 (2012){]}. In our model, a single nucleotide or domain is…
In this paper we consider the time complexity of computing the sum and product of two $n$-bit numbers within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system…
Within biology, it is of interest to construct DNA complexes of a certain shape. These complexes can be represented through graph theory, using edges to model strands of DNA joined at junctions, represented by vertices. Because guided…
A challenge of molecular self-assembly is to understand how to design particles that self-assemble into a desired structure and not any of a potentially large number of undesired structures. Here we use simulation to show that a strategy of…
We investigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from DNA. Of particular practical importance is to find tile…
Technologies for sequencing (reading) and synthesizing (writing) DNA have progressed on a Moore's law-like trajectory over the last three decades. This has motivated the idea of using DNA for data storage. Theoretically, DNA-based storage…
Traditionally, computation within self-assembly models is hard to conceal because the self-assembly process generates a crystalline assembly whose computational history is inherently part of the structure itself. With no way to remove…
Inspired by biology's most sophisticated computer, the brain, neural networks constitute a profound reformulation of computational principles. Remarkably, analogous high-dimensional, highly-interconnected computational architectures also…