Randomized self-assembly for exact shapes

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 85-94

  Doty, David ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY SYSTEMS; CONCENTRATION PROGRAMMING; CONSTANT SIZES; HIGH PROBABILITY; LARGE N; TILE ASSEMBLY MODELS;

SELF ASSEMBLY;

EID: 77952364884     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.13     Document Type: Conference Paper

References (20)

1. L. Adleman, Q. Cheng, A. Goel, and M.-D. Huang, "Running time and program size for self-assembled squares," in STOC '01: Proceedings of the thirty-third annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2001, pp. 740-748.
2. F. Becker, I. Rapaport, and E. Rémila, "Self-assembling classes of shapes with a minimum number of tiles, and in optimal time," in Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2006, pp. 45-56.
3. D. M. Bollag, "Gel-filtration chromatography," Methods in Molecular Biology, vol. 36, November 1994.
4. H. Chandran, N. Gopalkrishnan, and J. H. Reif, "The tile complexity of linear assemblies," in 36th International Colloquium on Automata, Languages and Programming, vol. 5555, 2009.
5. E. D. Demaine, M. L. Demaine, S. P. Fekete, M. Ishaque, E. Rafalin, R. T. Schweller, and D. L. Souvaine, "Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues," Natural Computing, vol. 7, no. 3, pp. 347-370, 2008.
6. M.-Y. Kao and R. T. Schweller, "Reducing tile complexity for self-assembly through temperature programming," in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida, Jan. 2006, pp. 571-580, 2007.
7. -, "Randomized self-assembly for approximate shapes," in International Colloqium on Automata, Languages, and Programming (ICALP), ser. Lecture Notes in Computer Science, L. Aceto, I. Damgrd, L. A. Goldberg, M. M. Halldrsson, A. Inglfsdttir, and I. Walukiewicz, Eds., vol. 5125. Springer, 2008, pp. 370-384.
8. J. I. Lathrop, J. H. Lutz, and S. M. Summers, "Strict self-assembly of discrete Sierpinski triangles," Theoretical Computer Science, vol. 410, pp. 384-405, 2009.
9. M. Mitzenmacher and E. Upfal, Probability and Computing. Cambridge University Press, 2005.
10. M. J. Patitz, "Simulation of self-assembly in the abstract tile assembly model with ISU TAS," in 6th Annual Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices (Snowbird, Utah, USA, April 20-24 2009). To appear., 2009.
11. P. W. K. Rothemund, "Theory and experiments in algorithmic self-assembly," Ph.D. dissertation, University of Southern California, December 2001.
12. P. W. K. Rothemund and E. Winfree, "The program-size complexity of self-assembled squares (extended abstract)," in STOC '00: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2000, pp. 459-468.
13. P. W. Rothemund, N. Papadakis, and E. Winfree, "Algorithmic self-assembly of dna sierpinski triangles," PLoS Biology, vol. 2, no. 12, 2004.
14. J. Sambrook and D. Russell, Molecular Cloning: A Laboratory Manual. Cold Spring Harbor Laboratory Press, 2001.
15. N. C. Seeman, "Nucleic-acid junctions and lattices," Journal of Theoretical Biology, vol. 99, pp. 237-247, 1982.
16. A. Shapiro, E. Viñuela, and J. M. Jr., "Molecular weight estimation of polypeptide chains by electrophoresis in SDS-polyacrylamide gels," Biochem Biophys Res Commun., vol. 28, pp. 815-820, November 1967.
17. D. Soloveichik and E. Winfree, "Complexity of self-assembled shapes," SIAM Journal on Computing, vol. 36, no. 6, pp. 1544-1569, 2007.
18. H. Wang, "Proving theorems by pattern recognition - II," The Bell System Technical Journal, vol. XL, no. 1, pp. 1-41, 1961.
19. -, "Dominoes and the AEA case of the decision problem," in Proceedings of the Symposium on Mathematical Theory of Automata (New York, 1962). Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn, N.Y., 1963, pp. 23-55.
20. E. Winfree, "Algorithmic self-assembly of DNA," Ph.D. dissertation, California Institute of Technology, June 1998.