English
Related papers

Related papers: On the behavior of tile assembly system at high te…

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

This paper concerns the self-assembly of scaled-up versions of arbitrary finite shapes. We work in the multiple temperature model that was introduced by Aggarwal, Cheng, Goldwasser, Kao, and Schweller (Complexities for Generalized Models of…

Computational Complexity · Computer Science 2009-09-30 Scott M. Summers

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

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

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

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

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

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 consider the problem of fault-tolerance in nanoscale algorithmic self-assembly. We employ a variant of Winfree's abstract Tile Assembly Model (aTAM), the two-handed aTAM, in which square "tiles" -- a model of molecules constructed from…

Data Structures and Algorithms · Computer Science 2015-03-14 David Doty , Matthew J. Patitz , Dustin Reishus , Robert T. Schweller , Scott M. Summers

We prove that if a subset X of the integer Cartesian plane weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as *pumpability*, then X is a finite union of doubly…

Computational Complexity · Computer Science 2009-06-18 David Doty , Matthew J. Patitz , Scott M. Summers

We investigate a fundamental question regarding a benchmark class of shapes in one of the simplest, yet most widely utilized abstract models of algorithmic tile self-assembly. Specifically, we study the directed tile complexity of a $k…

Data Structures and Algorithms · Computer Science 2020-07-23 David Furcy , Scott M. Summers , Logan Withers

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

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

We prove that if a set $X \subseteq \Z^2$ weakly self-assembles at temperature 1 in a deterministic tile assembly system satisfying a natural condition known as \emph{pumpability}, then $X$ is a finite union of semi-doubly periodic sets.…

Discrete Mathematics · Computer Science 2009-03-12 David Doty , Matthew J Patitz , Scott M Summers

Thermal-Aware Scheduling (TAS) provides methods to manage the thermal dissipation of a computing chip during task execution. These methods aim to avoid issues such as accelerated aging of the device, premature failure and degraded chip…

Systems and Control · Electrical Eng. & Systems 2024-04-26 Anthony Dowling , Ming-Cheng Cheng , Yu Liu

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

We consider non cooperative binding in so called `temperature 1', in deterministic (here called {\it confluent}) tile self-assembly systems (1-TAS) and prove the standing conjecture that such systems do not have universal computational…

Computational Complexity · Computer Science 2019-01-25 Jérôme Durand-Lose , Hendrik Jan Hoogeboom , Nataša Jonoska

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