English
Related papers

Related papers: On the directed tile assembly systems at temperatu…

200 papers

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

In this paper, we study the minimum number of unique tile types required for the self-assembly of thin rectangles in Winfree's abstract Tile Assembly Model (aTAM), restricted to temperature-1. Using Catalan numbers, planar self-assembly and…

Computational Geometry · Computer Science 2019-06-18 David Furcy , Scott M. Summers , Christian Wendlandt

In this paper we demonstrate the power of a model of tile self-assembly based on active glues which can dynamically change state. We formulate the Signal-passing Tile Assembly Model (STAM), based on the model of Padilla, Liu, and Seeman to…

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

Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for an arbitrary finite, connected shape $X \subset \mathbb{Z}^2$, there is a tile set that uniquely self-assembles into a 3D representation of…

Computational Geometry · Computer Science 2015-07-24 David Furcy , Scott M. Summers

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

The 2-Handed Assembly Model (2HAM) is a tile-based self-assembly model in which, typically beginning from single tiles, arbitrarily large aggregations of static tiles combine in pairs to form structures. The Signal-passing Tile Assembly…

Emerging Technologies · Computer Science 2013-12-16 Tyler Fochtman , Jacob Hendricks , Jennifer E. Padilla , Matthew J. Patitz , Trent A. Rogers

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

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

We prove that the number of tile types required to build squares of size n x n, in Winfree's abstract Tile Assembly Model, when restricted to using only non-cooperative tile bindings, is at least 2n-1, which is also the best known upper…

Computational Complexity · Computer Science 2013-12-10 Pierre-Étienne Meunier

The abstract tile assembly model (aTam) is a model of DNA self-assembly. Most of the studies focus on cooperative aTAM where a form of synchronization between the tiles is possible. Simulating Turing machines is achievable in this context.…

Computational Complexity · Computer Science 2026-05-11 Sergiu Ivanov , Damien Regnault

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

As a mathematical model of self-assembling systems, Winfree's abstract Tile Assembly Model (aTAM) is a remarkable platform for studying the behaviors and powers of self-assembling systems. Capable of Turing universal computation, the aTAM…

Computational Geometry · Computer Science 2016-08-11 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

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

In this work we propose a generalization of Winfree's abstract Tile Assembly Model (aTAM) in which tile types are assigned rigid shapes, or geometries, along each tile face. We examine the number of distinct tile types needed to assemble…

Computational Geometry · Computer Science 2015-03-19 Bin Fu , Matthew J. Patitz , Robert T. Schweller , Bobby Sheline

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

The molecular self-assembly of various structures such as micelles and vesicles has been the subject of comprehensive studies. Recently, a new approach to design these structures, the frame-guided assembly, has been developed to progress…

Chemical Physics · Physics 2022-05-11 Simon Raschke , Andreas Heuer

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…

Computational Geometry · Computer Science 2014-04-30 Andrew Winslow

Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal assembly, and (2) error correction. We address both questions,…

Data Structures and Algorithms · Computer Science 2009-09-16 Aaron Sterling