English
Related papers

Related papers: Optimal program-size complexity for self-assembly …

200 papers

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…

Computational Complexity · Computer Science 2021-07-19 Pierre-Etienne Meunier , Damien Regnault

We show that the Tile Assembly Model exhibits a strong notion of universality where the goal is to give a single tile assembly system that simulates the behavior of any other tile assembly system. We give a tile assembly system that is…

Computational Complexity · Computer Science 2016-09-08 David Doty , Jack H. Lutz , Matthew J. Patitz , Scott M. Summers , Damien Woods

Is Winfree's abstract Tile Assembly Model (aTAM) "powerful?" Well, if certain tiles are required to "cooperate" in order to be able to bind to a growing tile assembly (a.k.a., temperature 2 self-assembly), then Turing universal computation…

Emerging Technologies · Computer Science 2012-02-02 Matthew J. Patitz , Robert T. Schweller , Scott M. Summers

Self-assembly is one of the prevalent strategies used by living systems to fabricate ensembles of precision nanometer-scale structures and devices. The push for analogous approaches to create synthetic nanomaterials has led to the…

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…

Computational Complexity · Computer Science 2015-07-31 Pierre-Étienne Meunier , Damien Regnault

We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some constant temperature. In this…

Computational Geometry · Computer Science 2015-09-24 Sándor P. Fekete , Robert T. Schweller , Andrew Winslow

In this paper, we work in a 2D version of the probabilistic variant of Winfree's abstract Tile Assembly Model defined by Chandran, Gopalkrishnan and Reif (SICOMP 2012) in which attaching tiles are sampled uniformly with replacement. First,…

Data Structures and Algorithms · Computer Science 2024-08-13 David Furcy , Scott M. Summers

The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree exhibited a self-assembly that tiles the first quadrant of the…

Computational Complexity · Computer Science 2015-05-18 Jack H. Lutz , Brad Shutters

Algorithmic self-assembly, a generalization of crystal growth processes, has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanostructures. A `program' for growing a desired structure…

Materials Science · Physics 2010-01-08 Rebecca Schulman , Erik Winfree

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…

Computational Geometry · Computer Science 2014-07-11 Pierre-Étienne Meunier

We propose a mathematical model of DNA self-assembly using 2D tiles to form 3D nanostructures. This is the first work to combine studies in self-assembly and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our model…

Computational Complexity · Computer Science 2007-05-23 Ming-Yang Kao , Vijay Ramachandran

In this paper we investigate the computational power of the polygonal tile assembly model (polygonal TAM) at temperature 1, i.e. in non-cooperative systems. The polygonal TAM is an extension of Winfree's abstract tile assembly model (aTAM)…

Computational Geometry · Computer Science 2015-08-20 Oscar Gilbert , Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1…

Computational Geometry · Computer Science 2015-03-13 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield…

Data Structures and Algorithms · Computer Science 2017-09-20 Aaron T. Becker , Sándor P. Fekete , Phillip Keldenich , Dominik Krupke , Christian Rieck , Christian Scheffer , Arne Schmidt

In this paper we explore the power of geometry to overcome the limitations of non-cooperative self-assembly. We define a generalization of the abstract Tile Assembly Model (aTAM), such that a tile system consists of a collection of…

Emerging Technologies · Computer Science 2014-08-20 Sándor P. Fekete , Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers , Robert T. Schweller

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…

Computational Complexity · Computer Science 2016-10-28 Pierre-Étienne Meunier , Damien Regnault

We consider staged self-assembly systems, in which square-shaped tiles can be added to bins in several stages. Within these bins, the tiles may connect to each other, depending on the glue types of their edges. Previous work by Demaine et…

Data Structures and Algorithms · Computer Science 2017-01-03 Erik D. Demaine , Sándor P. Fekete , Christian Scheffer , Arne Schmidt

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…

Computational Complexity · Computer Science 2010-11-29 Nathaniel Bryans , Ehsan Chiniforooshan , David Doty , Lila Kari , Shinnosuke Seki

Self-assembly is a process which is ubiquitous in natural, especially biological systems. It occurs when groups of relatively simple components spontaneously combine to form more complex structures. While such systems have inspired a large…

Computational Geometry · Computer Science 2018-07-19 Jerome Durand-Lose , Jacob Hendricks , Matthew J. Patitz , Ian Perkins , Michael Sharp

We consider non-cooperative binding, so-called 'temperature 1', in deterministic or directed (called here confluent) tile self-assembly systems in two dimensions and show a necessary and sufficient condition for such system to have an…

Computational Complexity · Computer Science 2022-02-11 Jérôme Durand-Lose , Hendrik Jan Hoogeboom , Nataša Jonoska