title: Probabilistic Analysis of Pattern Formation in Monotonic Self-Assembly.
abstract: Inspired by biological systems, self-assembly aims to construct complex structures. It functions through piece-wise, local interactions among component parts and has the potential to produce novel materials and devices at the nanoscale. Algorithmic self-assembly models the product of self-assembly as the output of some computational process, and attempts to control the process of assembly algorithmically. Though providing fundamental insights, these computational models have yet to fully account for the randomness that is inherent in experimental realizations, which tend to be based on trial and error methods. In order to develop a method of analysis that addresses experimental parameters, such as error and yield, this work focuses on the capability of assembly systems to produce a pre-determined set of target patterns, either accurately or perhaps only approximately. Self-assembly systems that assemble patterns that are similar to the targets in a significant percentage are "strong" assemblers. In addition, assemblers should predominantly produce target patterns, with a small percentage of errors or junk. These definitions approximate notions of yield and purity in chemistry and manufacturing. By combining these definitions, a criterion for efficient assembly is developed that can be used to compare the ability of different assembly systems to produce a given target set. Efficiency is a composite measure of the accuracy and purity of an assembler. Typical examples in algorithmic assembly are assessed in the context of these metrics. In addition to validating the method, they also provide some insight that might be used to guide experimentation. Finally, some general results are established that, for efficient assembly, imply that every target pattern is guaranteed to be assembled with a minimum common positive probability, regardless of its size, and that a trichotomy exists to characterize the global behavior of typical efficient, monotonic self-assembly systems in the literature.
authors.affiliation: Department of Computer Science, University of Memphis, Memphis, TN, United States of America.
authors.forename: Tyler G
authors.initials: TG
authors.lastname: Moore
authors.affiliation: Department of Computer Science, University of Memphis, Memphis, TN, United States of America.
authors.forename: Max H
authors.initials: MH
authors.lastname: Garzon
authors.affiliation: Department of Electrical Engineering and Computer Engineering, University of Memphis, Memphis, TN, United States of America.
authors.forename: Russell J
authors.initials: RJ
authors.lastname: Deaton
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D008954:Models, Biological