English
Related papers

Related papers: Strict Self-Assembly of Discrete Sierpinski Triang…

200 papers

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

It is well known that the discrete Sierpinski triangle can be defined as the nonzero residues modulo 2 of Pascal's triangle, and that from this definition one can easily construct a tileset with which the discrete Sierpinski triangle…

Other Computer Science · Computer Science 2009-01-22 Steven M. Kautz , James I. Lathrop

In this paper we consider the problem of the strict self-assembly of infinite fractals within tile self-assembly. In particular, we provide tile assembly algorithms for the assembly of the discrete Sierpinski triangle and the discrete…

Computational Geometry · Computer Science 2015-05-26 Cameron T. Chalk , Dominic A. Fernandez , Alejandro Huerta , Mario A. Maldonado , Robert T. Schweller , Leslie Sweet

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

Self-assembly is one of the most promising strategies for making functional materials at the nanoscale, yet new design principles for making self-limiting architectures, rather than spatially unlimited periodic lattice structures, are…

Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This…

Computational Complexity · Computer Science 2015-03-13 David Doty

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

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

In contrast to most self-assembling synthetic materials, which undergo unbounded growth, many biological self-assembly processes are self-limited. That is, the assembled structures have one or more finite dimensions that are much larger…

Soft Condensed Matter · Physics 2022-05-25 Huang Fang , Botond Tyukodi , W. Benjamin Rogers , Michael F. Hagan

Both biological and artificial self-assembly processes can take place by a range of different schemes, from the successive addition of identical building blocks, to hierarchical sequences of intermediates, all the way to the fully…

Soft Condensed Matter · Physics 2015-08-12 Jim Madge , Mark A. Miller

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

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

We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material) and one operation that destroys all…

Computational Complexity · Computer Science 2010-07-09 Erik D. Demaine , Matthew J. Patitz , Robert T. Schweller , Scott M. Summers

In the self-assembly process which drives the formation of cellular membranes, micelles, and capsids, a collection of separated subunits spontaneously binds together to form functional and more ordered structures. In this work, we study the…

Biological Physics · Physics 2021-05-04 Mobolaji Williams

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

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 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 ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…

Soft Condensed Matter · Physics 2022-03-02 Thomas E. Videbæk , Huang Fang , Daichi Hayakawa , Botond Tyukodi , Michael F. Hagan , W. Benjamin Rogers

The fluid phase diagram of trimer particles composed of one central attractive bead and two repulsive beads was determined as a function of simple geometric parameters using flat-histogram Monte Carlo methods. A variety of self-assembled…

Soft Condensed Matter · Physics 2015-05-20 Harold W. Hatch , Jeetain Mittal , Vincent K. Shen
‹ Prev 1 2 3 10 Next ›