English
Related papers

Related papers: A pumping lemma for non-cooperative self-assembly

200 papers

Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for all $N \in \mathbb{N}$, there is a tile set that uniquely self-assembles into an $N \times N$ square shape at temperature 1 with optimal…

Computational Geometry · Computer Science 2014-11-06 David Furcy , Samuel Micka , Scott M. Summers

This paper explores the use of negative (i.e., repulsive) interaction the abstract Tile Assembly Model defined by Winfree. Winfree postulated negative interactions to be physically plausible in his Ph.D. thesis, and Reif, Sahu, and Yin…

Data Structures and Algorithms · Computer Science 2015-05-18 David Doty , Lila Kari , Benoit Masson

We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measures are…

Computational Geometry · Computer Science 2008-03-04 Erik D. Demaine , Martin L. Demaine , Sandor P. Fekete , Mashhood Ishaque , Eynat Rafalin , Robert T. Schweller , Diane Souvaine

We investigate the power of the Wang tile self-assembly model at temperature 1, a threshold value that permits attachment between any two tiles that share even a single bond. When restricted to deterministic assembly in the plane, no…

Computational Complexity · Computer Science 2015-03-13 Matthew Cook , Yunhui Fu , Robert T. Schweller

In this paper we explore the power of tile self-assembly models that extend the well-studied abstract Tile Assembly Model (aTAM) by permitting tiles of shapes beyond unit squares. Our main result shows the surprising fact that any aTAM…

Data Structures and Algorithms · Computer Science 2012-12-20 Erik D. Demaine , Martin L. Demaine , Sándor P. Fekete , Matthew J. Patitz , Robert T. Schweller , Andrew Winslow , Damien Woods

In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…

Emerging Technologies · Computer Science 2024-03-12 Phillip Drake , Matthew J. Patitz , Scott M. Summers , Tyler Tracy

We present a strict separation between the class of "mismatch free" self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently grown parts must always agree with each other. Tile…

Computational Geometry · Computer Science 2015-02-20 Florent Becker , Pierre-Étienne Meunier

We present an active tile assembly model which extends Winfree's abstract tile assembly model to tiles that are capable of transmitting and receiving binding site activation signals. In addition, we introduce a mathematical framework to…

Emerging Technologies · Computer Science 2012-11-14 Natasha Jonoska , Daria Karpenko

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

Sequence-directed assembly processes - such as protein folding - allow the assembly of a large number of structures with high accuracy from only a small handful of fundamental building blocks. We aim to explore how efficiently sequence…

Biological Physics · Physics 2025-03-14 Jeremy Guntoro , Thomas Ouldridge

The algorithmic self-assembly of shapes has been considered in several models of self-assembly. For the problem of \emph{shape construction}, we consider an extended version of the Two-Handed Tile Assembly Model (2HAM), which contains…

Computational Geometry · Computer Science 2016-08-18 Austin Luchsinger , Robert Schweller , Tim Wylie

We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly process. To do this, we propose novel techniques for…

Computational Complexity · Computer Science 2007-05-23 Ming-Yang Kao , Robert Schweller

Majumder, Reif and Sahu have presented a stochastic model of reversible, error-permitting, two-dimensional tile self-assembly, and showed that restricted classes of tile assembly systems achieved equilibrium in (expected) polynomial time.…

Computational Complexity · Computer Science 2009-08-04 Aaron Sterling

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…

Computational Geometry · Computer Science 2023-05-05 Daniel Hader , Matthew J. Patitz

We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T.…

Data Structures and Algorithms · Computer Science 2012-04-10 David Doty , Jack H. Lutz , Matthew J. Patitz , Robert T. Schweller , Scott M. Summers , Damien Woods

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

The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest…

Computational Complexity · Computer Science 2008-06-22 David Soloveichik , Erik Winfree

Self-assembly refers to the process by which small, simple components mix and combine to form complex structures using only local interactions. Designed as a hybrid between tile assembly models and cellular automata, the Tile Automata (TA)…

Emerging Technologies · Computer Science 2019-06-06 John Calvin Alumbaugh , Joshua J. Daymude , Erik D. Demaine , Matthew J. Patitz , Andrea W. Richa

The recently introduced Thermodynamic Binding Networks (TBN) model was developed with the purpose of studying self-assembling systems by focusing on their thermodynamically favorable final states, and ignoring the kinetic pathways through…

Emerging Technologies · Computer Science 2018-02-09 Cameron Chalk , Jacob Hendricks , Matthew J. Patitz , Michael Sharp

Behaviors of Winfree's tile assembly systems (TASs) at high temperatures are investigated in combination with integer programming of a specific form called threshold programming. First, we propose a way to build bridges from the Boolean…

Computational Complexity · Computer Science 2012-11-22 Shinnosuke Seki , Yasushi Okuno