P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Combinatorial Optimization Problems in Self-Assembly - Adleman, Cheng, Goel.. (2002) (3 citations) Self-citation (Rothemund) (Correct)
....an algorithm is analogous to a program verifier and may well be of independent interest in practical settings. In this paper, we present such an algorithm for the case where the tile system has a unique seed, and the shape must have a single occurrence of the seed. A recent result by Cook et al. [5, 17] allows an extension of our basic verification algorithm to the general case where the tile system can have multiple seeds and there can be multiple occurrences of the seed within the shape. We then show that the Minimum Tile Set Problem is polynomial time tractable on tree shapes and squares . ....
.... large structures (say 10,000 tiles) with error rates of less than 10 4 in reasonable amounts of time (say a week) and nucleation should be wellcontrolled [23] New experimental DNA systems, designed explicitly so that error and nucleation rates may be easily measured, are now being explored [17]. Already tiles have been held in a supersaturated state (one prerequisite for controlled nucleation) for approximately 6 hours [17] The outlook for experimental self assembly using these systems is promising. Gracias et al. 8] have used the self assembly of small plastic and metal objects to ....
[Article contains additional citation context not shown here]
P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly University of Southern California Ph.D. Thesis Copyright 2001
Invadable Self-Assembly: Combining Robustness with Eciency - Ho-Lin Chen Qi (2004) (1 citation) (Correct)
No context found.
P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, 2001.
Optimal Self-Assembly of Counters at - Temperature Two Qi (Correct)
No context found.
P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, 2001.
Invadable Self-Assembly: Combining Robustness with Eciency - Ho-Lin Chen Qi (2004) (1 citation) (Correct)
No context found.
P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, 2001.
Running Time and Program Size for Self-assembled Squares - Leonard Adleman University (2001) (2 citations) (Correct)
No context found.
P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly University of Southern California Ph.D. Thesis Copyright 2001.
Error Free Self-Assembly using Error Prone Tiles - Ho-Lin Chen Ashish (Correct)
No context found.
P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC