Search results

Jump to navigation Jump to search

Page title matches

Page text matches

  • [[Category:Self-assembly]]
    1 KB (188 words) - 15:21, 27 May 2014
  • |title=Self-Assembly of Infinite Structures: A Survey |abstract=We survey some recent results related to the self-assembly of infinite structures in
    \(1 bytes (89 words) - 13:13, 22 June 2021
  • [[Category:Self-assembly]]
    \(1 bytes (98 words) - 11:13, 15 July 2016
  • [[Category:Self-assembly]]
    2 KB (311 words) - 11:55, 8 July 2019
  • |title=Self-Assembly of Discrete Self-Similar Fractals techniques to work around such limitations. Specifically, we investigate the self-assembly of fractal shapes
    1 KB (141 words) - 12:46, 22 June 2021
  • Essentially, strict self-assembly means that tiles are only placed ...Note that if $X \in \mathbb{Z}^2$ strictly self-assembles, then $X$ [[Weak Self-Assembly | weakly
    \(1 bytes (95 words) - 15:20, 27 May 2014
  • [[Category:Self-assembly]]
    \(1 bytes (41 words) - 15:20, 27 May 2014
  • |title=Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS an abstract model for tile based self-assembly, it has proven to be remarkably powerful and expressive in terms of the str
    1 KB (194 words) - 12:49, 22 June 2021
  • The kinetic Slat Assembly Model is a more physically realistic model of the self-assembly of slats as defined in the [[Abstract Slat Assembly Model (aSAM)]]. It is b [[Category:Self-assembly]]
    \(1 bytes (151 words) - 20:40, 26 April 2023
  • |title=Self-Assembly of Decidable Sets self-assembly. Finally, we show that our characterization is robust with respect to vario
    \(1 bytes (118 words) - 12:46, 22 June 2021
  • |title=Limitations of Self-Assembly at Temperature 1 the case of temperature 2 self-assembly, no discrete self-similar fractal weakly self-assembles at
    1 KB (144 words) - 13:14, 22 June 2021
  • [[Category:Self-assembly]]
    \(1 bytes (13 words) - 12:52, 1 July 2019
  • |title=Intrinsic Universality in Self-Assembly ...Winfree, and of Demaine et al.) in that we simulate the actual process of self-assembly, not just the end result, as in Soloveichik and Winfree’s construction, a
    2 KB (300 words) - 13:06, 22 June 2021
  • ...self-assembly does not imply the ability to simulate arbitrary algorithmic self-assembly processes. |file=[http://arxiv.org/abs/1304.1679 Intrinsic universality in tile self-assembly requires cooperation]
    2 KB (231 words) - 12:32, 22 June 2021
  • \(1 bytes (39 words) - 15:20, 8 August 2013
  • |title=Identifying Shapes Using Self-Assembly ...lgorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify
    \(1 bytes (108 words) - 12:29, 22 June 2021
  • [[Category:Self-assembly]]
    \(1 bytes (31 words) - 15:37, 27 May 2014
  • Essentially, weak self-assembly can be thought of [[Strict Self-Assembly]]
    \(1 bytes (88 words) - 15:22, 27 May 2014
  • ...ile assembly system T. The simulation is "intrinsic" in the sense that the self-assembly process carried out by U is exactly that carried out by T, with each tile o ...f the simulated system T. At each location of a potential supertile in the self-assembly of U, a decision is made whether and how to express this genome, i.e., whet
    1 KB (228 words) - 12:58, 22 June 2021
  • |abstract=Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed
    3 KB (412 words) - 10:07, 14 June 2022
  • [[Category:Self-assembly]]
    \(1 bytes (103 words) - 15:19, 27 May 2014
  • [[Category:Self-assembly]] title = "Self-Assembly with Geometric Tiles",
    2 KB (285 words) - 14:06, 2 July 2019
  • ...hat this pattern cannot self-assemble within a number of well studied tile self-assembly models. |file=[http://arxiv.org/abs/1202.5012 Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient Computation and Efficient Assembly of Shapes]
    2 KB (357 words) - 12:19, 22 June 2021
  • [[Category:Self-assembly]]
    2 KB (273 words) - 14:44, 28 July 2016
  • ...ppeared. In [[Automated self-assembly programming paradigm]] Lin Li uses a self-assembly algorithm combined with genetic algorithms to generate the code for inserti In the same year Yuriy Brun in his thesis [[Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized dis
    \(1 bytes (127 words) - 11:59, 27 May 2014
  • ...evious stage supply each bin with input assemblies. The output of a staged self-assembly system is the set of assemblies produced in the bins of the final stage. <r | caption2 = The summary of results from the Optimal Staged Self-Assembly paper.
    2 KB (232 words) - 10:51, 25 July 2016
  • ...nd molecular computing, and the plausibility of implementing 3 dimensional self-assembly systems, our techniques may provide the needed power of temperature 2 syste |file=[[Media:Temp1 deterministic3d probablistic2d.pdf | Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D.pdf]]
    2 KB (264 words) - 13:46, 22 June 2021
  • ...ere's a solution: double check, triple check, quadruple check. In DNA tile self-assembly theory, there is a natural way to do this, using proofreading tile sets. He ...Increasing Redundancy Exponentially Reduces Error Rates during Algorithmic Self-Assembly.pdf]
    \(1 bytes (108 words) - 13:05, 22 June 2021
  • ...class of shapes whose study has proven fruitful in the development of new self-assembly systems. |file=[[media:RandSAICALP.pdf | Randomized Self-Assembly for Approximate Shapes.pdf]]
    1 KB (210 words) - 13:10, 22 June 2021
  • ...orming "covert computation" within tile self-assembly that seeks to design self-assembly systems that "conceal" both the input and computational history of performe
    2 KB (214 words) - 10:19, 14 June 2022
  • ...onal (but local) rules. The latter are considered examples of algorithmic self-assembly, since by following computational rules as they combine, the self-assemblin ...at least for mildly computationally complex algorithms). Another model of self-assembly which is non-algorithmic is [[DNA origami]].
    1 KB (175 words) - 12:09, 16 June 2016
  • [[Category:Self-assembly]]
    \(1 bytes (138 words) - 12:11, 8 July 2019
  • |title=Creating Algorithmic Self-Assembly of DNA Sierpinski Triangles ...lementation of arbitrary cellular automata. This shows that engineered DNA self-assembly can be treated as a Turing-universal biomolecular system, capable of implem
    2 KB (204 words) - 12:13, 22 June 2021
  • self-assembly process. We observe that the DNA structures
    1 KB (143 words) - 20:24, 22 June 2022
  • [[Category:Self-assembly]]
    3 KB (431 words) - 12:40, 18 July 2022
  • ...umber of tiles, can be engineered. Under this assumption, traditional tile self-assembly cannot even manufacture an $n \times n$ square; in contrast, we show how st |file=[[media:NaturalComputing.pdf | Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues.pdf]]
    1 KB (170 words) - 12:51, 22 June 2021
  • This collection of slides was used for a course on self-assembly given by Scott and is an amazing and very comprehensive set of slides for l [http://self-assembly.net/ssummers/slides/Notes_on_2HAM.ppt 2HAM Notes] <br />
    3 KB (394 words) - 11:35, 13 June 2015
  • ...cale factor 2. This greatly improves previous shape replication results in self-assembly that required models in which multiple assembly stages and/or bins were req ...xiv.org/pdf/1503.01244v1.pdf Replication of arbitrary hole-free shapes via self-assembly with signal-passing tiles (extended abstract).pdf]
    \(1 bytes (145 words) - 12:43, 22 June 2021
  • ...(i.e., glue functions must be "diagonal"). We call this abstract model of self-assembly the <i>restricted glue</i> Tile Assembly Model (rgTAM). We achieve two posi
    2 KB (290 words) - 13:35, 22 June 2021
  • |title=Automated self-assembly programming paradigm |abstract=Self-assembly is a ubiquitous process in nature in which a disordered set of components
    3 KB (369 words) - 00:34, 21 April 2012
  • [[Category:Self-assembly]]
    1 KB (164 words) - 15:39, 26 June 2022
  • [[Category:Self-assembly]]
    \(1 bytes (137 words) - 15:19, 27 May 2014
  • |abstract=We first give an introduction to the field of tile-based self-assembly, focusing primarily on theoretical models and their algorithmic nature. We ....net/mpatitz/papers/Self-assembly-survey.pdf An Introduction to Tile-Based Self-Assembly and a Survey of Recent Results.pdf]
    1 KB (216 words) - 13:01, 22 June 2021
  • [[Category:Self-assembly]] ...improvement over the tile complexity of existing models for thin rectangle self-assembly <ref name=kari2019simplifying/>.
    2 KB (359 words) - 21:51, 29 July 2019
  • [[Category:Self-assembly]]
    1 KB (192 words) - 15:39, 27 May 2014
  • \(1 bytes (80 words) - 13:52, 27 May 2014
  • ...ntly than high concentration species) then the parallelism of hierarchical self-assembly provides no advantage at all (caveat, caveat). If you want to build large c ....edu/Papers/hierarchical_SODA2012.pdf Parallelism and Time in Hierarchical Self-Assembly.pdf]
    \(1 bytes (139 words) - 13:09, 22 June 2021
  • ...emperature of a tile system is dynamically adjusted by the experimenter as self-assembly proceeds. This allows sections of assemblies that are bound with less stren ...the multiple temperature model has a similar flavor to that of the staged self-assembly model in the sense that the input to a tile system in both models can be en
    2 KB (259 words) - 10:38, 25 July 2016
  • ...bjects exponentially faster and more compactly than can be done by passive self-assembly systems such as tile assembly. |file=[http://www.dna.caltech.edu/Papers/nubotsITCS2013.pdf Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time.pdf]
    1 KB (189 words) - 13:01, 22 June 2021
  • \(1 bytes (7 words) - 21:30, 21 May 2013
  • \(1 bytes (7 words) - 21:35, 21 May 2013
  • http://www.self-assembly.net/mpatitz/software/TileSetDesigner.zip |Download=[http://www.self-assembly.net/mpatitz/software/TileSetDesigner.zip]
    1 KB (178 words) - 13:44, 27 May 2014
  • ...or the negative y-axis, depending on the command line arguments used. See "Self-Assembly of Decidable Sets" by Patitz and Summers for a detailed description.
    \(1 bytes (126 words) - 13:12, 28 August 2013
  • ...Our improved time is achieved by demonstrating a set of tiles for parallel self-assembly of binary counters. Our improved program size is achieved by demonstrating ...for computation. In addition the development of a computational theory of self-assembly promises to provide a new conduit by which results and methods of theoretic
    1 KB (226 words) - 12:44, 22 June 2021
  • title = {Parallelism and Time in Hierarchical Self-Assembly}, [[Category:Self-assembly]]
    1 KB (173 words) - 15:58, 27 May 2014
  • |abstract=Theories of the logic and kinetics of algorithmic self-assembly make many idealizations that eliminate complexities and clarify essential i ...Design2013.pdf DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly.pdf]
    \(1 bytes (114 words) - 13:05, 22 June 2021
  • |abstract=The field of algorithmic self-assembly is concerned with the computational and expressive power of nanoscale se
    2 KB (341 words) - 12:55, 22 June 2021
  • \(1 bytes (120 words) - 12:13, 28 August 2013
  • ...e to perform complex computations or algorithmically direct the process of self-assembly. Nonetheless, a variety of models based on slight modifications to the aTAM |file=[http://arxiv.org/abs/1403.3841 Doubles and Negatives are Positive (in Self-Assembly)]
    2 KB (307 words) - 12:28, 22 June 2021
  • ...ure change can constitute a natural, dynamic method for providing input to self-assembly systems that is potentially superior to the current technique of designing ...f-AssemblyThroughTemperatureProgramming.pdf | Reducing Tile Complexity for Self-Assembly Through Temperature Programming.pdf]]
    2 KB (255 words) - 12:39, 22 June 2021
  • [[Category:Self-assembly]]
    2 KB (264 words) - 16:04, 27 May 2014
  • |abstract=In this paper we explore the power of tile self-assembly models that extend the well-studied abstract Tile Assembly Model (aTAM) by
    2 KB (258 words) - 12:35, 22 June 2021
  • |file=[http://www.self-assembly.net/mpatitz/papers/dslptam.pdf A Domain-Specific Language for Programming i
    \(1 bytes (148 words) - 13:01, 22 June 2021
  • |title=Computability and Complexity in Self-Assembly of nanoscale self-assembly. We work in the two-dimensional tile assembly model, i.e., in the discrete
    1 KB (196 words) - 13:29, 22 June 2021
  • ...ed in the standard aTAM for Turing universal computation and the efficient self-assembly of shapes, but we show that in the DaTAM these behaviors can in fact be exh |file=[http://arxiv.org/abs/1402.4515 The Power of Duples(in Self-Assembly): It's Not So Hip To Be Square]
    2 KB (259 words) - 12:56, 22 June 2021
  • |abstract=In this paper we explore the power of tile self-assembly models that extend the well-studied abstract Tile Assembly Model (aTAM) by
    2 KB (262 words) - 12:36, 22 June 2021
  • ...pers/multnucl-dna16.pdf Resiliency to Multiple Nucleation in Temperature~1 Self-Assembly.pdf]
    1 KB (211 words) - 13:42, 22 June 2021
  • title = {Parallelism and Time in Hierarchical Self-Assembly}, [[Category:Self-assembly]]
    2 KB (333 words) - 15:16, 27 May 2014
  • [[Category:Self-assembly]] title = "Theory of Algorithmic Self-Assembly",
    3 KB (479 words) - 14:22, 17 June 2019
  • 2 KB (286 words) - 12:58, 22 June 2021
  • ...ility of structures. In this paper, we present a new mathematical model of self-assembly, based on the abstract Tile Assembly Model (aTAM), called the Flexible Tile
    2 KB (270 words) - 13:26, 25 July 2019
  • [[Category:Self-assembly]]
    \(1 bytes (13 words) - 14:51, 28 July 2016
  • |title=Self-Assembly with Geometric Tiles |file=[http://arxiv.org/abs/1104.2809 Self-Assembly with Geometric Tiles]
    2 KB (258 words) - 12:47, 22 June 2021
  • title = "Combinatorial optimization problems in self-assembly", title = "Complexities for Generalized Models of Self-Assembly",
    2 KB (341 words) - 15:17, 27 May 2014
  • |title=Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature |abstract=We consider the problem of fault-tolerance in nanoscale algorithmic self-assembly. We employ
    3 KB (444 words) - 12:51, 22 June 2021
  • ...d structural properties, and by utilizing the bottom-up growth paradigm of self-assembly to create them we not only learn important techniques for building such com |file=[http://arxiv.org/pdf/1606.01856v1 Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles]
    1 KB (163 words) - 12:29, 22 June 2021
  • [[Category:Self-assembly]] title = "The Power of Duples (in Self-Assembly): It's Not So Hip To Be Square",
    3 KB (496 words) - 14:06, 31 May 2019
  • ...Haskell implementation of the programs from "Noncooperative algorithms in self-assembly".
    \(1 bytes (19 words) - 14:25, 12 June 2014
  • ...stem. We employ this result to show that, unlike the case of temperature 2 self-assembly, no discrete self-similar fractal weakly self-assembles at temperature 1 in ...ngle glue alone. This paper demonstrates many limitations of temperature 1 self-assembly which lacks cooperation.
    4 KB (674 words) - 22:41, 23 July 2019
  • ...sembly model. Given an input shape, we consider the problem of designing a self-assembly system which will replicate that shape into either a specific number of cop |file=[[media:Replicate.pdf | Shape Replication Through Self-Assembly and RNase Enzymes.pdf]]
    1 KB (163 words) - 12:48, 22 June 2021
  • ...ure-1 aTAM systems. Finally, we connect our work with other work on domino self-assembly to show that temperature-1 assembly with at least 2 distinct shapes, regard ...df Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly.pdf]
    2 KB (298 words) - 13:00, 22 June 2021
  • |title=Universal Shape Replication Via Self-Assembly With Signal-Passing Tiles ...this paper, we investigate shape-assembling power of a tile-based model of self-assembly called the Signal-Passing Tile Assembly Model (STAM). In this model, the gl
    2 KB (268 words) - 11:30, 10 June 2022
  • |abstract=DNA tile self-assembly provides a molecular architecture for algorithmically programming the growt ...dTubes2013.pdf Integrating DNA strand-displacement circuitry with DNA tile self-assembly.pdf]
    \(1 bytes (118 words) - 13:05, 22 June 2021
  • The multiple temperature model generalizes the tile self-assembly model by permitting the temperature of the system to shift up and down. Agg ...Programming|Ming-Yang Kao, Robert Schweller. Reducing Tile Complexity for Self-Assembly Through Temperature Programming.]]
    3 KB (431 words) - 01:22, 27 August 2012
  • |abstract=The 2-Handed Assembly Model (2HAM) is a tile-based self-assembly model in which, typically beginning from single tiles, arbitrarily large ag ...ignal Transmission Across Tile Assemblies: 3D Static Tiles Simulate Active Self-Assembly by 2D Signal-Passing Tiles.pdf]
    2 KB (331 words) - 12:48, 22 June 2021
  • [[Category:Self-assembly]]
    \(1 bytes (30 words) - 13:30, 4 August 2021
  • ...ly, we work within the 2-Handed Assembly Model (2HAM), which is a model of self-assembly in which assemblies are formed by square tiles that are allowed to combine, ...1 The Simulation Powers and Limitations of Higher Temperature Hierarchical Self-Assembly Systems]
    2 KB (311 words) - 12:57, 22 June 2021
  • |title=Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with |abstract=We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which
    1 KB (212 words) - 12:45, 22 June 2021
  • 1 KB (234 words) - 12:34, 22 June 2021
  • ...ed several techniques for reducing errors that occur during DNA tile-based self-assembly, many of them have done so without allowing for the modification of the bas title = {Error suppression mechanisms for DNA tile self-assembly and their simulation},
    3 KB (401 words) - 15:13, 27 May 2014
  • ...and inconveniences. Use at your own risk! Please feel free to email tas@self-assembly.net with any questions, comments, etc. We hope that you enjoy this softwar [http://self-assembly.net/software/RodSim/ RodSim Beta Release (C++ code)] Note that the latest v
    2 KB (237 words) - 10:48, 19 October 2023
  • ...and inconveniences. Use at your own risk! Please feel free to email tas@self-assembly.net with any questions, comments, etc. We hope that you enjoy this softwar [http://self-assembly.net/software/SlatTAS/ SlatTAS Beta Release (Python code)] Note that the lat
    2 KB (242 words) - 10:47, 19 October 2023
  • [[Category:Self-assembly]]
    4 KB (730 words) - 13:52, 11 June 2019
  • ...M) but also allows for tile shapes that are polygons. Although a number of self-assembly results have shown computational universality at temperature 1, these are t
    1 KB (211 words) - 13:31, 22 June 2021
  • \(1 bytes (24 words) - 14:23, 27 May 2014
  • [[Category:Self-assembly]] ...a single assembly step.Despite substantial consideration, no purely growth self-assembly model has yet been shown to strictly assemble an infinite fractal without s
    5 KB (720 words) - 20:17, 31 July 2019
  • ...ion which achieves this bound. We consider whether the tile complexity for self-assembly can be reduced through several natural generalizations of the model. One of
    2 KB (326 words) - 17:29, 24 January 2012
  • ...ial time). In a series of results that culminated in showing that [http://self-assembly.net/wiki/index.php/Binary_pattern_tile_set_synthesis_is_NP-hard the PATS pr ...ated to the [http://self-assembly.net/wiki/index.php/Pattern_Self-Assembly self-assembly of patterns] on squares.
    4 KB (498 words) - 12:28, 4 March 2024
  • 1 KB (197 words) - 15:26, 27 May 2014
  • ...and inconveniences. Use at your own risk! Please feel free to email tas@self-assembly.net with any questions, comments, etc. We hope that you enjoy this softwar [http://self-assembly.net/software/WebTAS/WebTAS-latest/ WebTAS]
    1 KB (183 words) - 08:34, 30 April 2023

View (\(1 | \)2) (20 | 50 | 100 | 250 | 500)