Search results
Jump to navigation
Jump to search
Create the page "Self-assembly" on this wiki! See also the search results found.
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 str1 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
- ...aining relevant sub-categories of interest within the field of algorithmic self-assembly.95 members (7 subcategories, 0 files) - 01:02, 27 November 2011
- [[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], has7 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
- [[Category:Self-assembly]]12 members (0 subcategories, 0 files) - 17:56, 20 May 2013
- 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
- The notion of simulation in self-assembly has been well studied and gives us a notion of the power of systems relativ [[Category:Self-assembly]]3 members (0 subcategories, 0 files) - 11:28, 27 May 2014
- \(1 bytes (7 words) - 15:58, 27 May 2014
File:Covert-NOT-Assembly-Examples.png (1,546 × 331 (55 KB)) - 11:49, 14 June 2022- \(1 bytes (3 words) - 11:49, 20 June 2022
- self-assembly process. We observe that the DNA structures1 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, a2 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 discrete1 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 components3 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:Optimal staged assembly results.jpg (557 × 164 (36 KB)) - 10:13, 25 July 2016File:Infinite-assembly-0110010010101-marked.png (474 × 473 (20 KB)) - 16:15, 3 March 2024File:Infinite-assembly-high-level.png (405 × 405 (3 KB)) - 16:17, 3 March 2024- |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 shapes1 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 exists14 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, it12 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
Page text matches
File:Temp1 deterministic3d probablistic2d.pdf Temperature 1 Self-Assembly:(1.34 MB) - 14:10, 23 January 2012- [[Category:Self-assembly]]12 members (0 subcategories, 0 files) - 17:56, 20 May 2013
- [[Category:Self-assembly]]7 members (0 subcategories, 0 files) - 14:13, 11 June 2013
- [[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 shapes1 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 str1 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 at1 KB (144 words) - 13:14, 22 June 2021
- [[Category:Self-assembly]]\(1 bytes (13 words) - 12:52, 1 July 2019
- The notion of simulation in self-assembly has been well studied and gives us a notion of the power of systems relativ [[Category:Self-assembly]]3 members (0 subcategories, 0 files) - 11:28, 27 May 2014
- |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, a2 KB (300 words) - 13:06, 22 June 2021
- ...lated to DNA or other nano-scale structures that has been used in previous self-assembly research or is of possible interest in future work. [[Category:self-assembly]]1 member (0 subcategories, 0 files) - 01:10, 27 November 2011
- ...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
- ...ease see [[Main_Page#Getting_Started_in_Self-assembly | Getting Started in Self-assembly]]. ...ld like to help contribute in any way, please email Matt Patitz at mpatitz@self-assembly.net.\(1 bytes (75 words) - 14:33, 27 May 2014
- [[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
- Since self-assembly is a new and emerging field, the terminology associated with the field is f [[Category:Self-assembly]]18 members (0 subcategories, 0 files) - 13:49, 21 May 2013
- ...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., whet1 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 distributed3 KB (412 words) - 10:07, 14 June 2022
File:Counter-6x6.png (1,156 × 964 (32 KB)) - 10:22, 1 June 2013- [[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 performe2 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 implem2 KB (204 words) - 12:13, 22 June 2021
- self-assembly process. We observe that the DNA structures1 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 posi2 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 components3 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