English
Related papers

Related papers: Program Size and Temperature in Self-Assembly

200 papers

Harnessing the intrinsic dynamics of physical systems for information processing opens new avenues for computation embodied in matter. Using simulations of a model system, we show that assemblies of DNA tiles capable of self-organizing into…

Soft Condensed Matter · Physics 2025-10-23 Tim E. Veenstra , René van Roij , Marjolein Dijkstra

Recent advancements in microbiology have motivated the study of the production of nanostructures with applications such as biomedical computing and molecular robotics. One way to construct these structures is to construct branched DNA…

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

DNA self-assembly is an important tool that has a wide range of applications such as building nanostructures, the transport of target virotherapies, and nano-circuitry. Tools from graph theory can be used to encode the biological process of…

Combinatorics · Mathematics 2023-10-09 Cory Johnson , Andrew Lavengood-Ryan

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

Self assembly is a process by which supramolecular species form spontaneously from their components. This process is ubiquitous throughout the life chemistry and is central to biological information processing. It has been predicted that in…

Information Theory · Computer Science 2009-08-20 Anshul Chaurasia , Sudhanshu Dwivedi , Prateek Jain , Manish K. Gupta

We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield…

Data Structures and Algorithms · Computer Science 2017-09-20 Aaron T. Becker , Sándor P. Fekete , Phillip Keldenich , Dominik Krupke , Christian Rieck , Christian Scheffer , Arne Schmidt

Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate…

Discrete Mathematics · Computer Science 2013-02-13 Lila Kari , Steffen Kopecki , Amirhossein Simjour

Branched molecules of deoxyribonucleic acid (DNA) can self-assemble into nanostructures through complementary cohesive strand base pairing. The production of DNA nanostructures is valuable in targeted drug delivery and biomolecular…

Combinatorics · Mathematics 2022-03-15 D. Chloe Griffin , Jessica Sorrells

The Watson-Crick complementary properties of DNA make DNA a useful tool for the self-assembly of various target complexes. Concepts from graph theory can be used to model the self-assembling process in which the vertices of the graph…

Combinatorics · Mathematics 2023-02-28 Gabriel Lopez , Cory Johnson

The Tile Automata (TA) model describes self-assembly systems in which monomers can build structures and transition with an adjacent monomer to change their states. This paper shows that seeded TA is a non-committal intrinsically universal…

Cellular Automata and Lattice Gases · Physics 2024-07-17 Tim Gomez , Elise Grizzell , Asher Haun , Ryan Knobel , Tom Peters , Robert Schweller , Tim Wylie

Pattern self-assembly tile set synthesis (PATS) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard.…

Computational Complexity · Computer Science 2013-01-17 Shinnosuke Seki

Branched junction molecule assembly of DNA nanostructures, pioneered by Seeman's laboratory in the 1980s, has become increasingly sophisticated, as have the assembly targets. A critical design step is finding minimal sets of branched…

Combinatorics · Mathematics 2021-08-03 Leyda Almodóvar , Jo Ellis-Monaghan , Amanda Harsy , Cory Johnson , Jessica Sorrells

We consider non-cooperative binding, so-called 'temperature 1', in deterministic or directed (called here confluent) tile self-assembly systems in two dimensions and show a necessary and sufficient condition for such system to have an…

Computational Complexity · Computer Science 2022-02-11 Jérôme Durand-Lose , Hendrik Jan Hoogeboom , Nataša Jonoska

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

Inspired by recent successes using single-stranded DNA tiles to produce complex structures, we develop a two-step coarse-graining approach that uses detailed thermodynamic calculations with oxDNA, a nucleotide-based model of DNA, to…

Soft Condensed Matter · Physics 2018-04-09 Pedro Fonseca , Flavio Romano , John S. Schreck , Thomas E. Ouldridge , Jonathan P. K. Doye , Ard A. Louis

We investigate general properties of non-deterministic self-assembly with asymmetric interactions, using a computational model and DNA tile assembly experiments. By contrasting symmetric and asymmetric interactions we show that the latter…

Soft Condensed Matter · Physics 2016-08-24 S. Tesoro , K. Göpfrich , T. Kartanas , U. F. Keyser , S. E. Ahnert

We present a series of results related to mathematical models of self-assembling tiles and the impacts that three diverse properties have on their dynamics. We expand upon a series of prior results which showed that (1) the abstract Tile…

Computational Geometry · Computer Science 2019-10-10 Daniel Hader , Aaron Koch , Matthew J. Patitz , Michael Sharp

An oritatami system (OS) is a theoretical model of self-assembly via co-transcriptional folding. It consists of a growing chain of beads which can form bonds with each other as they are transcribed. During the transcription process, the…

Data Structures and Algorithms · Computer Science 2018-07-16 Erik D. Demaine , Jacob Hendricks , Meagan Olsen , Matthew J. Patitz , Trent A. Rogers , Nicolas Schabanel , Shinnosuke Seki , Hadley Thomas

Tile-based self-assembly systems are capable of universal computation and algorithmically-directed growth. Systems capable of such behavior typically make use of "glue cooperation" in which the glues on at least $2$ sides of a tile must…

Emerging Technologies · Computer Science 2019-03-15 Daniel Hader , Matthew J. Patitz
‹ Prev 1 3 4 5 6 7 10 Next ›