Abstract and Kinetic Tile Assembly Model
ثبت نشده
چکیده
and Kinetic Tile Assembly Model In the following section I will explain the model behind the Xgrow simulator. I will first explain the aTAM model which is the basis of kTAM, and then I will explain the improvements in kTAM. The Abstract Tile Assembly Model (aTAM) was proposed by Erik Winfree as a practical variation on Wang tiling. Although the model generalizes to any number of dimensions, much of the research in the community so far has focused on two or three dimensions. For simplicity, we will only discuss the two-dimensional model. A tile type t is a unit square that can be translated but not rotated. Each side u is covered with a "glue" of a certain "color" and "strength" specified by its type t. If two tiles are placed with their centers at adjacent points and if their abutting sides have glues that match in both color and strength, then they form a bond with this common strength. If the glues do not match, then no bond is formed between these tiles. Generally, glues have strength 0, 1, or 2 (although recent papers have noted that strength 2 is difficult to create in a laboratory setting). When drawing a tile as a square, each side's glue strength is generally indicated by a dotted line (0), solid line (1), or double line (2) while "color" is indicated by an alphanumeric label. Given a set T of tile types and a "temperature" N. Intuitively, an assembly is a placement of tiles. An assembly is stable if it cannot be broken into smaller sub-assemblies without breaking total bond of strength at least . A tile assembly in the aTAM always begins from a seed tile and builds outward from that. Although it is possible that tiles would bond to each other to form assemblies not including the seed tile, this is not modelled by the aTAM. Once the seed is present, the system proceeds asychronously and nondeterministically to bond tiles to the assembly. A tile assembly system (TAS) is an ordered triple ( ), where T is a finite set of tile types, σ is a seed Figure 1: The Sierpinski Tile set is shown in (d). The strengths of edges are marked, and the edge labels are denoted graphically. In (a) (c), small tiles are used to indicate possible stable additions to the aggregate. (a) When T=0, any tile addition is stable, and a random aggregate results. (b) When T=1, typically several stable possibilities at each site; again, a random aggregate results. (c) When T=2 , there is a unique possibility at each site, resulting in unique pattern formation. assembly with finite domain, and N is the temperature. We write [ ]or the set of all assemblies that can arise from . [ ], the set of terminal assemblies, represents the set of assemblies where no tile can be stably added. An assembly sequence in a TAS ( ) is an infinite sequence ( ) of assemblies in which and each is obtained from by the addition of a single tile. The Kinetic Tile Assembly Model (kTAM) is an improvement over the aTAM, in the sense that it enables reaction rates and reversible reactions. To model the kinetics of self-assembly, there are several simplifying assumptions made after tiles are created (Some of these assumptions can be ignored in some of the operation modes of the simulator.): 1. Tile concentrations will be held constant throughout the experiment. 2. All tile concentrations will remain the same. 3. Groups of tiles do not bond to each other, only to the aggregate including the seed tile. 4. The forward rate, or rate at which tiles add to the assembly, is constant between all the tiles. This means that, regardless of bond strength and color, 5. The reverse rate, or rate at which tiles are removed from the assembly, depends inverse exponentially on the strength of the bond. In this model, there are two parameters that can be altered by the experimenter and one that cannot. measures the entropic cost of fixing the location of a monomer unit (and is thus dependent on monomer concentration). measures the free energy cost of breaking a single-strength bond. Both are expressed in the thermal energy RT. The third parameter, the forward rate constant , simply sets the units for the time axis. The rate of forward associations of a particular tile type at a particular site is where represents the concentration of each tile. The dissociation (or backward) rate is . Figure 2: The rates of reactions for various tile association and dissociation steps in the Kinetic Assembly Model. Note that all on-rates are identical, and that off-rates depend only upon the total strength of correct edge matches. Mismatched edges and empty neighbors are treated identically According to experimental work, the optimal value and are when . The behavior of the system for different values of these parameters can be seen in the figure bellow: Figure 3: Analysis of the phase diagram for 2D self-assembly.
منابع مشابه
DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
A major challenge in practical DNA tile self-assembly is the minimization of errors. Using the kinetic Tile Assembly Model, a theoretical model of self-assembly, it has been shown that errors can be reduced through abstract tile set design. In this paper, we instead investigate the effects of “sticky end” sequence choices in systems using the kinetic model along with the nearest-neighbor model ...
متن کاملComputational modelling of the kinetic Tile Assembly Model using a rule-based approach
The Tile Assembly Model (TAM), is a mathematical paradigm for the study and algorithmic design of DNA self-assembly systems. It employs the use of so-called DNA-tiles, which are abstractions of experimentally achievable complexes with similar inter-matching behaviour. To this day, there are more than 5 different experimental implementations of DNA tiles and their sub-sequent algorithmic assembl...
متن کاملComputational modeling of the kinetic Tile Assembly Model using a rule-based approach
The (abstract) Tile Assembly Model (aTAM), is a mathematical paradigm for the study and algorithmic design of DNA self-assembly systems. It employs the use of so-called DNA-tiles, which are abstractions of experimentally achievable DNA nanostructure complexes with similar inter-matching behaviours. To this day, there are about half-dozen different experimental implementations of DNA tiles and t...
متن کاملAn Introduction to Tile-Based Self-assembly
In this tutorial, we give a brief introduction to the field of tile-based algorithmic self-assembly. We begin with a description of Winfree’s abstract Tile Assembly Model (aTAM) and a few basic exercises in designing tile assembly systems. We then survey a series of results in the aTAM. Next, we introduce the more experimentally realistic kinetic Tile Assembly Model (kTAM) and provide an exerci...
متن کاملSynthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly
We consider the problem of finding, for a given 2D pattern of coloured tiles, a minimal set of tile types self-assembling to this pattern in the abstract Tile Assembly Model of Winfree (1998). This Patterned self-Assembly Tile set Synthesis (PATS) problem was first introduced by Ma and Lombardi (2008), and subsequently studied by Göös and Orponen (2011), who presented an exhaustive partition-se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010