Molecular Assembly and Computation: From Theory to Experimental Demonstrations-Reference-Cited by-同舟云学术

Molecular Assembly and Computation: From Theory to Experimental Demonstrations

Published:2002 Issue: Volume: Page:1-21
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Reif John H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45465-9_1

Reference67 articles.

1. Adleman, L., Molecular Computation of Solution to Combinatorial Problems, Science, 266, 1021, (1994).

2. Adleman, L., Toward a mathematical theory of self-assembly, USC Tech Report, January 2000.

3. Adleman, L., Q. Cheng, A. Goel, M. Huang, D. Kempe, P. M. de Moisset and P. W. K. Rothemund, Combinatorial Optimization Problems in Self-Assembly, Thirty-Fourth Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, May 19–21, 2002. http://www-scf.usc.edu/~pwkr/papers.html

4. Adleman, L., Qi Cheng, Ashish Goel, Ming-Deh Huang and Hal Wasserman: Linear Self-Assemblies: equilibria, entropy, and convergence rates. Abstract Draft April 2000.

5. Adleman, L., Q. Cheng, A. Goel, M. Huang, D. Kempe, P. M. de Moisset and P. W. K. Rothemund, Combinatorial Optimization Problems in Self-Assembly, Thirty-Fourth Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, May 19–21, 2002.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A molecular solution for minimum vertex cover problem in tile assembly model;The Journal of Supercomputing;2013-03-16

2. Self-assembly of infinite structures: A survey;Theoretical Computer Science;2011-01

3. Computability and Complexity in Self-assembly;Theory of Computing Systems;2010-04-20

4. Strict self-assembly of discrete Sierpinski triangles;Theoretical Computer Science;2009-02

5. Strict Self-assembly of Discrete Sierpinski Triangles;Lecture Notes in Computer Science;2007