Advertisement
Published in:
2006 | OriginalPaper | Chapter
Self-correcting Self-assembly: Growth Models and the Hammersley Process
Authors : Yuliy Baryshnikov, Ed Coffman, Nadrian Seeman, Teddy Yimwadsana
Published in: DNA Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper extends the stochastic analysis of self assembly in DNA-based computation. The new analysis models an error-correcting technique called
pulsing
which is analogous to checkpointing in computer operation. The model is couched in terms of the well-known tiling models of DNA-based computation and focuses on the calculation of computation times, in particular the times to self assemble rectangular structures. Explicit asymptotic results are found for small error rates
q
, and exploit the connection between these times and the classical Hammersley process. Specifically, it is found that the expected number of pulsing stages needed to complete the self assembly of an
N
×
N
square lattice is asymptotically
$2N\sqrt{q}$
as
N
→∞ within a suitable scaling. Simulation studies are presented which yield performance under more general assumptions.