Algorithmic tile self-assembly model for the minimum set cover problem

Journal of Bionanoscience

Volumn 6, Issue 2, 2012, Pages 69-77

  Cheng, Zhen ^a   Xiao, Jianhua ^b  

^a ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

^b NANKAI UNIVERSITY   (China)

Author keywords

Algorithmic; Minimum Set Cover Problem.; Self Assembly; Tile

Indexed keywords

ALGORITHMIC; COMPUTATION MODEL; COMPUTATIONAL PROBLEM; MINIMUM SET COVER PROBLEM; SELF-ASSEMBLING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SELF ASSEMBLY; TILE;

PROBLEM SOLVING;

EID: 84869190815     PISSN: 15577910     EISSN: 15577929     Source Type: Journal    
DOI: 10.1166/jbns.2012.1079     Document Type: Article

References (33)

1. L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science 266, 1021 (1994).
2. L. Q. Pan, G. W. Liu, and J. Xu, Prog. Nat. Sci. 14, 104 (2004).
3. L. Pan and C. Martin-Vide, Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes, J. Parallel Distr. Com. 65, 1578 (2005).
4. L. Pan and M. J. Pérez-Jiménez, Computational complexity of tissuelike P systems, J. Complexity 26, 296 (2010).
5. N. C. Seeman, DNA nanotechnology: novel DNA constructions, Annu. Rev. Biophy. Biomol. Struct. 27, 225 (1998).
6. C. Mao, W. Sun, and N. C. Seeman, Designed two dimensional DNA Holliday junction arrays visualized by atomic force microscopy, J. Am. Chem. Soc. 121, 5437 (1999).
7. R. Barish, P. W. Rothemund, and E. Winfree, Two computational primitives for algorithmic self-assembly: copying and counting, Nano Lett. 12, 2586 (2005).
8. P. W. Rothemund, Nature 440, 297 (2006).
9. M. J. Patitz and S. M. Summers, Self-assembly of infinite structures: a survey, Theor. Comput. Sci. 412, 159 (2011).
10. N. C. Seeman, Structural DNA nanotechnology: growing along with Nano Letters, Nano Lett. 10, 1971 (2010).
11. J. I. Lathrop, J. H. Lutz, and S. M. Summers, Strict self-assembly of discrete Sierpinski triangles, Theor. Comput. Sci. 410, 384 (2009).
12. J. Zheng, J. J. Birktoft, Y. Chen, Y. Chen, T. Wang, R. Sha, P. E. Constantinou, S. L. Ginell, C. Mao, and N. C. Seeman, Nature 461, 74 (2009).
13. S. Douglas, H. Dietz, T. Liedl, B. Högberg, F. Graf, and W. M. Shih, Nature 459, 414 (2009).
14. E. Winfree, On the computational power of DNA annealing and ligation, DNA Based Computers, 99 (1996).
15. A. Carbone, N. C. Seeman, Molecular Tiling and DNA Selfassembly, Lect. Notes Comput. Sci. 2950, 61 (2004).
16. C. Mao, T. H. LaBean, and J. H. Reif, Nature 407, 493 (2000).
17. Y. Brun, Theor. Comput. Sci. 378, 17 (2006).
18. R. Barua and S. Das, Finite field arithmetic using self-assembly of DNA tilings. Proceedings of IEEE Congress on Evolutionary Computation, Canberra, Australia (2003), pp. 8-12.
19. G. L. Michail and T. H. LaBean, DIMACS Ser. Discrete Math. Theor. 44, 139 (1999).
20. Y. Brun, Theor. Comput. Sci. 395, 3 (2008).
21. Y. Brun and D. Reishus, Path finding in the tile assembly model, Theor. Comput. Sci. 410, 1461 (2009).
22. A. Gehani, T. H. LaBean, and J. H. Reif, DNA-Based Cryptography, Proceedings of the 5th DIMACS Workshop on DNA Based Computers Cambridge, Massachusetts (1999), pp. 14-15.
23. N. Jonoska and G. L. McColm, Theor. Comput. Sci. 410, 332 (2009).
24. J. H. Reif, S. Sahu, and P. Yin, Theor. Comput. Sci. 412, 1592 (2011).
25. D. Chen and W. Huang, Comput. Sci. 34, 133 (2007).
26. H. Mhand, T. P. Vangelis, and Z. Vassilis, Chaos Solitons Frac. 11, 2079 (2000).
27. Z. Pei, L. Rong, G. Chong, An efficient algorithm for the minimum set cover problem. Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, Dalian, China (2006), pp. 13-16.
28. Z. Zhang, X. Gao, and W. Wu, Theor. Comput. Sci. 410, 812 (2009).
29. J. Xu, S. Li, Y. Dong, and X. Wei, Sticker DNA computer model-Part II: application, Chinese Science Bulletin 49, 863 (2004).
30. W. Liu, X. Zhu, and G. Xu, A DNA based evolutionary algorithm for the minimal set cover problem, Proceedings of international conference on Advances in Intelligent Computing, Hefei, China (2005), pp. 23-26.
31. H. Wang, I. Bell System Technical Journal 40, 1 (1961).
32. E. Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, Caltech, Pasadena, CA, June (1998).
33. K. Fujibayashi and S. Murata, Precise simulation model for DNA tile self-assembly, IEEE T. Nanotechnol. 8, 361 (2009).