English
Related papers

Related papers: Strong Fault-Tolerance for Self-Assembly with Fuzz…

200 papers

Winfree's abstract Tile Assembly Model (aTAM) is a model of molecular self-assembly of DNA complexes known as tiles, which float freely in solution and attach one at a time to a growing "seed" assembly based on specific binding sites on…

Computational Complexity · Computer Science 2015-03-17 Ho-Lin Chen , David Doty , 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

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 (aTAM), the phenomenon of cooperation occurs when the attachment of a new tile to a growing assembly requires it to bind to more than one tile already in the assembly. Often referred to as…

Emerging Technologies · Computer Science 2014-03-18 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

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

In this paper we define the Dupled abstract Tile Assembly Model (DaTAM), which is a slight extension to the abstract Tile Assembly Model (aTAM) that allows for not only the standard square tiles, but also "duple" tiles which are rectangles…

Emerging Technologies · Computer Science 2014-03-10 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers , 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

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

Computational Geometry · Computer Science 2024-05-13 Phillip Drake , Daniel Hader , Matthew J. Patitz

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

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

In the abstract Tile Assembly Model (aTAM) square tiles self-assemble, autonomously binding via glues on their edges, to form structures. Algorithmic aTAM systems can be designed in which the patterns of tile attachments are forced to…

Emerging Technologies · Computer Science 2022-11-10 Andrew Alseth , Matthew J. Patitz

In this paper, we extend existing results about simulation and intrinsic universality in a model of tile-based self-assembly. Namely, we work within the 2-Handed Assembly Model (2HAM), which is a model of self-assembly in which assemblies…

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

In this paper, we prove that in the abstract Tile Assembly Model (aTAM), an accretion-based model which only allows for a single tile to attach to a growing assembly at each step, there are no tile assembly systems capable of…

Emerging Technologies · Computer Science 2018-07-18 Jacob Hendricks , Joseph Opseth , Matthew Patitz , Scott Summers

We prove a negative result on the power of a model of algorithmic self-assembly for which it has been notoriously difficult to find general techniques and results. Specifically, we prove that Winfree's abstract Tile Assembly Model, when…

Computational Complexity · Computer Science 2013-04-11 Pierre-Étienne Meunier , Matthew J. Patitz , Scott M. Summers , Guillaume Theyssier , Andrew Winslow , Damien Woods

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

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

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

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

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
‹ Prev 1 2 3 10 Next ›