Related papers: Self-Replication via Tile Self-Assembly

The process of self-assembly is guided by the minimization of free energy, which limits the symmetries available for assembly and ultimately the usefulness of devices fabricated in this fashion. Here, we demonstrate experimentally for 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…

Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This…

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…

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…

The ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…

Inspired by protein folding, we explored the construction of three-dimensional structures and machines from one-dimensional chains of simple building blocks. This approach not only allows us to recreate the self-replication mechanism…

We prove a result which strongly hints at the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions. Specifically, we prove that, in Winfree's abstract Tile…

Genome assembly from the high-throughput sequencing (HTS) reads is a fundamental yet challenging computational problem. An intrinsic challenge is the uncertainty caused by the widespread repetitive elements. Here we get around the…

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 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…

We prove the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions. Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to…

In this paper we introduce a new method to design interparticle interactions to target arbitrary crystal structures via the process of self-assembly. We show that it is possible to exploit the curvature of the crystal nucleation free-energy…

Both biological and artificial self-assembly processes can take place by a range of different schemes, from the successive addition of identical building blocks, to hierarchical sequences of intermediates, all the way to the fully…

We introduce a new property of tile self-assembly systems that we call size-separability. A system is size-separable if every terminal assembly is a constant factor larger than any intermediate assembly. Size-separability is motivated by…

The observation by Ke et al. [Science 338, 1177 (2012)] that large numbers of short, pre-designed DNA strands can assemble into three-dimensional target structures came as a great surprise, as no colloidal self-assembling system has ever…

In this paper we show that passive self-assembly in the context of the tile self-assembly model is capable of performing fuel efficient, universal computation. The tile self-assembly model is a premiere model of self-assembly in which…

We show the first asymptotically efficient constructions in the so-called "noncooperative planar tile assembly" model. Algorithmic self-assembly is the study of the local, distributed, asynchronous algorithms ran by molecules to…

We present an analytically solvable model for self-assembly of a molecular complex on a filament. The process is driven by a seed molecule that undergoes facilitated diffusion, which is a search strategy that combines diffusion in…

We present a simple route to circumvent kinetic traps which affect many types of DNA nanostructures in their self-assembly process. Using this method, a new 2D DNA lattice made up of short, single-stranded tile (SST) motifs was created.…