메뉴 건너뛰기




Volumn , Issue , 2009, Pages 209-219

Simulation of self-assembly in the abstract tile assembly model with ISU TAS

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT MODELS; ASSEMBLY SYSTEMS; GRAPHICAL SIMULATORS; IOWA STATE UNIVERSITY; SELF-ASSEMBLE; SELF-ASSEMBLING STRUCTURE; SOURCE CODES; TILE ASSEMBLY MODELS;

EID: 78751556963     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (13)
  • 1
    • 84874676665 scopus 로고    scopus 로고
    • accessed January 2009
    • OpenGL, http://www.opengl.org (accessed January 2009).
  • 2
    • 84874727989 scopus 로고    scopus 로고
    • wxWidgets Cross-Platform GUI Library, accessed January 2009
    • wxWidgets Cross-Platform GUI Library, http://www.wxwidgets.org (accessed January 2009).
  • 3
    • 84874689634 scopus 로고    scopus 로고
    • DNA and Natural Algorithms Group, Xgrow simulator, accessed January 2009
    • DNA and Natural Algorithms Group, Xgrow simulator, http://www.dna. caltech.edu/Xgrow (accessed January 2009).
  • 4
    • 84874735026 scopus 로고    scopus 로고
    • Charles Karney RandomLib, accessed January 2009
    • Charles Karney, RandomLib, http://charles.karney.info/random (accessed January 2009).
  • 5
    • 84874752263 scopus 로고    scopus 로고
    • Mark Kilgard, Texfont, accessed January 2009
    • Mark Kilgard, Texfont, http://www.opengl.org/resources/code/samples/glut. examples/texfont/texfont.html (accessed January 2009).
  • 6
    • 58249142297 scopus 로고    scopus 로고
    • Summers, Strict self-assembly of discrete Sierpinski triangles
    • James I. Lathrop, Jack H. Lutz, and Scott M. Summers, Strict self-assembly of discrete Sierpinski triangles, Theoretical Computer Science 410 (2009), 384-405.
    • (2009) Theoretical Computer Science , vol.410 , pp. 384-405
    • Lathrop, J.I.1    Lutz, J.H.2    Scott, M.3
  • 8
    • 0033701726 scopus 로고    scopus 로고
    • The program-size complexity of self-assembled squares (extended abstract)
    • Paul W. K. Rothemund and Erik Winfree, The program-size complexity of self-assembled squares (extended abstract)., STOC, 2000, pp. 459-468.
    • (2000) STOC , pp. 459-468
    • Paul, W.1    Rothemund, K.2    Winfree, E.3
  • 9
    • 14044251445 scopus 로고    scopus 로고
    • Algorithmic self-assembly of dna sierpinski triangles
    • Paul W.K. Rothemund, Nick Papadakis, and Erik Winfree, Algorithmic self-assembly of dna sierpinski triangles, PLoS Biology 2 (2004), no. 12.
    • (2004) PLoS Biology , vol.2 , Issue.12
    • Paul, W.K.1    Nick Papadakis, R.2    Winfree, E.3
  • 10
    • 0020373595 scopus 로고
    • Nucleic-acid junctions and lattices
    • N.C. Seeman, Nucleic-acid junctions and lattices, Journal of Theoretical Biology 99 (1982), 237-247.
    • (1982) Journal of Theoretical Biology , vol.99 , pp. 237-247
    • Seeman, N.C.1
  • 11
  • 12
    • 84944488797 scopus 로고
    • Proving theorems by pattern recognition-II
    • Hao Wang, Proving theorems by pattern recognition-II, The Bell System Technical Journal XL (1961), no. 1, 1-41.
    • (1961) The Bell System Technical Journal , vol.40 , Issue.1 , pp. 1-41
    • Wang, H.1
  • 13
    • 0003546918 scopus 로고    scopus 로고
    • Ph.D. thesis, California Institute of Technology, June
    • Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology, June 1998.
    • (1998) Algorithmic Self-assembly of DNA
    • Winfree, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.