Search results

Jump to navigation Jump to search

Page title matches

  • ...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
  • |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
  • ...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 (311 words) - 11:55, 8 July 2019
  • [[Category:Self-assembly]]
    1 KB (192 words) - 15:39, 27 May 2014
  • ...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
  • Essentially, weak self-assembly can be thought of [[Strict Self-Assembly]]
    \(1 bytes (88 words) - 15:22, 27 May 2014
  • 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
  • 5 KB (971 words) - 10:51, 27 May 2014
  • ...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
  • \(1 bytes (5 words) - 11:00, 20 July 2016
  • [[Category:Self-assembly]] ...esigning optimal tile sets to self-assemble patterned squares, the [http://self-assembly.net/wiki/index.php/PATS_problem_and_tile_set_generation PATS problem], has
    7 KB (1,078 words) - 23:57, 7 March 2024
  • \(1 bytes (24 words) - 14:23, 27 May 2014
  • |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
  • |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 = {Parallelism and Time in Hierarchical Self-Assembly}, [[Category:Self-assembly]]
    2 KB (333 words) - 15:16, 27 May 2014
  • \(1 bytes (127 words) - 14:21, 25 November 2013
  • \(1 bytes (7 words) - 15:58, 27 May 2014
  • \(1 bytes (3 words) - 11:49, 20 June 2022
  • self-assembly process. We observe that the DNA structures
    1 KB (143 words) - 20:24, 22 June 2022
  • |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
  • |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=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
  • \(1 bytes (5 words) - 14:50, 4 December 2011
  • ...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
  • |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 (188 words) - 15:21, 27 May 2014
  • [[Category:Self-assembly]]
    3 KB (431 words) - 12:40, 18 July 2022
  • \(1 bytes (7 words) - 21:30, 21 May 2013
  • \(1 bytes (7 words) - 21:35, 21 May 2013
  • ...ightful introduction to and review of the theory of tile-based algorithmic self-assembly -- complete with a motivational video! ...dna.caltech.edu/Papers/algorithmic_tiles2012doty.pdf Theory of Algorithmic Self-Assembly.pdf]
    \(1 bytes (43 words) - 12:59, 22 June 2021
  • ...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
  • |file=[http://arxiv.org/abs/1404.5985 Reflections on Tiles (in Self-Assembly)]
    1 KB (217 words) - 13:40, 22 June 2021
  • ...peared in several papers and by several different names (e.g. hierarchical self-assembly, polyominoes, etc.) <ref name="Winfree06" /><ref name="Luhrs08" /><ref name title = "Complexities for Generalized Models of Self-Assembly",
    21 KB (3,206 words) - 11:13, 11 July 2013
  • |title=Random Number Selection in Self-Assembly .../www.self-assembly.net/mpatitz/papers/RNSSA.pdf Random Number Selection in Self-Assembly.pdf]
    1 KB (161 words) - 13:43, 22 June 2021
  • #REDIRECT [[Identifying Shapes Using Self-Assembly]]
    \(1 bytes (5 words) - 22:54, 29 November 2011
  • |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
  • 1 KB (197 words) - 15:26, 27 May 2014
  • ...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
  • Self-assembly begins with a [[Assembly#Seed Assembly| seed assembly]] $\sigma$ and A set $X \in \mathbb{Z}^2$ [[Weak Self-Assembly | weakly self-assembles]] if there exists
    14 KB (2,199 words) - 12:11, 11 June 2019
  • ...stic model for laboratory settings, and considers the reversible nature of self-assembly, factoring in the rates of association and dissociation of basic molecular Because the kTAM accurately models the behavior of DNA based tile self-assembly in the laboratory, most especially the common types of errors observed, it
    12 KB (1,760 words) - 16:06, 27 May 2014
  • ...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
  • ...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
  • .../Papers/minimal_tile_systems_ISAAC2011.pdf Program Size and Temperature in Self-Assembly.pdf]
    \(1 bytes (96 words) - 13:37, 22 June 2021
  • http://self-assembly.net/software/PolyominoTAS/ ...= "Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly",
    6 KB (1,047 words) - 10:31, 29 June 2022
  • Self-assembly begins with a $\emph{seed assembly}$ $\sigma$, in which each tile has a spe ...$\alpha_r = F(\alpha , r, v)$ and dom $\alpha_r = X$. Essentially, strict self-assembly means that tiles are only placed in positions defined by the shape. Note th
    9 KB (1,498 words) - 12:27, 20 June 2016
  • title = "Self-Assembly with Geometric Tiles", ...e = "Geometric Tiles and Powers and Limitations of Geometric Hindrance in Self-Assembly",
    5 KB (750 words) - 22:33, 9 July 2019
  • ...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 ...ions motivated by simple rules; a process uniquely suited to simulation in self-assembly systems. The [[Abstract Tile Assembly Model (aTAM)|aTAM]] has been demonstr
    5 KB (800 words) - 11:45, 12 July 2019
  • [[Category:Self-assembly]] The maze itself is constructed from [http://self-assembly.net/wiki/index.php?title=Polyomino_Tile_Assembly_Model_(polyTAM) polyomino
    3 KB (489 words) - 17:32, 13 July 2022
  • ...heir self-assembly, and visualizing the results can be found here: [http://self-assembly.net/software/slats_sim_tiles/ slats_sim_tiles] (The latest version can be f [[Category:Self-assembly]]
    13 KB (2,307 words) - 21:03, 8 May 2024

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

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