Algorithmic Tile Self-assembly Model for the Minimum Dominating Set Problem

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 201)

Abstract

Self-assembly is the process in which simple components can spontaneously form complex complexes. This field has produced a formal model of self-assembly known as the tile self-assembly model. Recently, computation by this model is proved to be a promising technique in nanotechnology. In this paper, aiming to the minimum dominating set problem which is NP-complete, how the tile self-assembly model is used to implement this problem is shown including nondeterministic guess operation, assigning operation and logic OR operation. This method can be successfully performed this problem in Θ(n 2) steps. Here n is the number of vertices of the given graph in the minimum dominating set problem.

Keywords

Minimum dominating set problem Algorithmic Tile Self-assembly 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgments

This work was supported by the Research Project of Department of Education of Zhejiang Province (Y201120124), and the National Natural Science Foundation of China (Grant Nos. 61202204, 61202011, 60903105, 61170054).

References

  1. Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021-1024(1994).Google Scholar
  2. Pan, L., Martin-Vide, C.: Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes. J. Parallel Distr. Com. 65, 1578-1584(2005).Google Scholar
  3. Pan, L., Pérez-Jiménez, M.J.: Computational complexity of tissue-like P systems. J. Complexity. 26, 296-315(2010).Google Scholar
  4. Pan, L.Q., Liu, G.W., Xu, J.: Solid phase based DNA solution of the coloring problem. Prog. Nat. Sci. 14, 104-107(2004).Google Scholar
  5. Carbone, A., Seeman N.C.: Molecular Tiling and DNA Self-assembly. Lect. Notes Comput. Sci. 2950, 61-83(2004).Google Scholar
  6. Seeman, N.C.: DNA nanotechnology: novel DNA constructions. Annu. Rev. Biophy. Biomol. Struct. 27, 225-248(1998).Google Scholar
  7. Mao, C., Sun, W., Seeman, N.C.: Designed two dimensional DNA Holliday junction arrays visualized by atomic force microscopy. J. Am. Chem. Soc. 121, 5437-5443(1999).Google Scholar
  8. Barish, R., Rothemund, P.W., Winfree, E.: Two computational primitives for algorithmic self-assembly: copying and counting. Nano Lett. 12, 2586-2592(2005).Google Scholar
  9. Rothemund, P., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol. 12, 2041-2053(2004).Google Scholar
  10. Zheng, J., Birktoft, J.J., Chen, Y.: From molecular to macroscopic via the rational design of a self-assembled 3D DNA crystal. Nature 461, 74-77(2009).Google Scholar
  11. Douglas, S., Dietz, H., Liedl, T.: Self-assembly of DNA into nanoscale three-dimensional shapes. Nature 459, 414-418(2009).Google Scholar
  12. Cook, M., Rothemund, P.W., Winfree, E.: Self-assembled circuit patterns. In Proceedings of the 9th International Meeting on DNA Based Computers, Madison, WI, USA, 91-107, June 2003.Google Scholar
  13. Rothemund, P.W.: Folding DNA to create nanoscale shapes and patterns. Nature 440, 297-302(2006).Google Scholar
  14. Winfree, E.: On the computational power of DNA annealing and ligation. DNA Based Computers II: DIMACS Workshop, American Mathematical Society Publishers, Rhode Island (1996).Google Scholar
  15. Mao, C., LaBean, T.H., Reif, J. H.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407, 493-496(2000).Google Scholar
  16. Brun, Y.: Arithmetic computation in the tile assembly model: addition and multiplication, Theor. Comput. Sci. 378, 17-31(2006).Google Scholar
  17. Brun, Y.: Nondeterministic polynomial time factoring in the tile assembly model. Theor. Comput. Sci. 395, 3-23 (2008).Google Scholar
  18. Brun, Y., Reishus, D.: Path finding in the tile assembly model. Theor. Comput. Sci. 410, 1461-1472(2009).Google Scholar
  19. Barua, R., Das, S.: Finite field arithmetic using self-assembly of DNA tilings. In Proceedings of congress on evolutionary computation, 2529-36(2003).Google Scholar
  20. Lagoudakis, M.G., LaBean, T.H.: 2D DNA self-assembly for satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 54, 141-154(1999).Google Scholar
  21. Jonoska, N., McColm, G.L.: Complexity classes for self-assembling flexible tiles. Theor. Comput. Sci. 410, 332-346(2009).Google Scholar
  22. Reif, J.H., Sahu, S., Yin, P.: Complexity of graph self-assembly in accretive systems and self-destructible systems. Theor. Comput. Sci. 412: 1592-1605(2011).Google Scholar
  23. Wu, J., Cardei, M., Dai, F., Yang, S.: Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication. IEEE T PARALL DISTRI 17, 851-864(2006).Google Scholar
  24. Bian, Y., Yu, H., Zeng, P.: Construction of a fault tolerance connected dominating set in wireless sensor network. International Conference on Measuring Technology and Mechatronics Automation 1, 610-614(2009).Google Scholar
  25. Basavanagoud, B., Teredhahalli, I.M.: On minimal and vertex minimal dominating graph.Google Scholar
  26. Journal of Informatics and Mathematical Sciences 1, 139-146(2009).Google Scholar
  27. Ho, C. K., Singh, Y. P., Ewe, H.T.: An enhanced ant colony optimization metaheuristic forGoogle Scholar
  28. the minimum dominating set problem. Applied Artificial Intelligence 20, 881-903, (2006).Google Scholar
  29. Guo, M.Y., Michael, H., Chang, W.L.: Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing. Parallel Computing 30, 1109-1125(2004).Google Scholar
  30. Liu, X.R., Wang, S.D., Xi, F.: A biomolecular computing model in vivo for minimum dominating set problem. Chinese Journal of Computer 32, 2325-2331(2009).Google Scholar
  31. Wang, H.: Proving theorems by pattern recognition. I. Bell System Technical Journal 40, 1-42(1961).Google Scholar
  32. Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. Thesis, Caltech, Pasadena, CA, June (1998).Google Scholar
  33. Fujibayashi, K., Murata, S.: Precise simulation model for DNA tile self-assembly. IEEE T. Nanotechnol. 8, 361-368(2009).Google Scholar

Copyright information

© Springer India 2013

Authors and Affiliations

  1. 1.College of Computer Science and TechnologyZhejiang University of TechnologyHangzhouChina
  2. 2.The Research Center of Logistics Nankai UniversityTianjinChina
  3. 3.College of MathematicsSouthwest Jiaotong UniversityChengduChina

Personalised recommendations