@inproceedings{59fd6fa85f88400aaa7b16c189aa8eff,

title = "Self-correcting self-assembly: Growth models and the hammersley process",

abstract = "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 √q as N → ∞ within a suitable scaling. Simulation studies are presented which yield performance under more general assumptions.",

author = "Yuliy Baryshnikov and Ed Coffman and Nadrian Seeman and Teddy Yimwadsana",

year = "2006",

doi = "10.1007/11753681_1",

language = "English (US)",

isbn = "3540341617",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "1--11",

booktitle = "DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers",

note = "11th International Workshop on DNA Computing, DNA11 ; Conference date: 06-06-2005 Through 09-06-2005",

}