2008
DOI: 10.1166/jctn.2008.2565
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic Analysis of Reversible Self-Assembly

Abstract: The theoretical basis of computational self-assembly dates back to the idea of Wang tiling models in the early 1960s.1 More recently, it has been recognized that self-assembly is a promising route to nano-scale computation and there have been many experimental demonstrations of self-assembling DNA tiles performing computation. Winfree 2 proposed abstract irreversible (only tile accretion is allowed) models for the self-assembly process that can perform universal computation. Realism, however, requires us to de… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 36 publications
0
10
0
Order By: Relevance
“…At appropriately chosen temperatures, these tiles will have a good chance of assembling according to these prescribed rules, although they also have a chance of disassociating and breaking apart. Majumder et al [13] consider a DNA self-assembly model that allows the left column and bottom row of a large square to first form, and then iteratively allows tiles to associate with the large substrate if their left and bottom neighbors are already present (see Figure 1a). Likewise, tiles can disassociate if their upper and right neighbors are not present, although disassociation happens at a lower rate.…”
Section: Introductionmentioning
confidence: 99%
“…At appropriately chosen temperatures, these tiles will have a good chance of assembling according to these prescribed rules, although they also have a chance of disassociating and breaking apart. Majumder et al [13] consider a DNA self-assembly model that allows the left column and bottom row of a large square to first form, and then iteratively allows tiles to associate with the large substrate if their left and bottom neighbors are already present (see Figure 1a). Likewise, tiles can disassociate if their upper and right neighbors are not present, although disassociation happens at a lower rate.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, several streams of work [13], [14] have recognized the import of reversibility in theoretical selfassembly models. Reversibility is a feature that is essential for modeling molecular self-assembly processes realistically.…”
Section: B Reversibilitymentioning
confidence: 99%
“…We, like [7], assume that the motion of the agents is stochastic, with the agents tendency to form and sever certain bonds programmable. The use of stochastic decision policies was previously introduced in [13], but performance is not guaranteed. General global-tolocal techniques for programmable self-assembly are considered in [9].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…At appropriately chosen temperatures, these tiles will have a good chance of assembling according to these prescribed rules, although they also have a chance of disassociating and breaking apart. Majumder, Sahu and Reif [14] consider a DNA self-assembly model that allows the left column and bottom row of a large square to first form, and then iteratively allows tiles to associate with the large substrate if their left and bottom neighbours are already present (see Figure 1(a)). Likewise, tiles can disassociate if their upper and right neighbours are not present, although disassociation happens at a lower rate.…”
Section: Introductionmentioning
confidence: 99%