A novel approach for the classical Ramsey number problem on DNA-based supercomputing

Match

Volumn 66, Issue 1, 2011, Pages 347-370

  Zhou, Xu ^a,b   Li, Kenli ^a   Goodman, Makojoa ^a   Sallam, Ahmed ^a  

^a HUNAN UNIVERSITY   (China)

^b JIAXING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80155214043     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. K. H. Zimmermann, Efficient DNA sticker algorithms for NP-complete graph problems, Comput. Phys. Commun. 144 (2002) 297-309.
2. W. L. Chang, M. Ho, M. Guo, X. Jiang, J. Xue, M. Li, Fast parallel DNA-based algorithms for molecular computation: Determining a prime number, Proceedings of the Third International Conference on Information Technology and Applications, 2005, pp. 447-452. (Pubitemid 43763090)
3. W. L. Chang, T. T. Ren, J. Luo, M. Feng, M. Guo, K. W. Lin, Quantum algorithms for biomolecular solutions of the satisfiability problem on a quantum machine, IEEE Trans. Nanobiosci. 7 (2008) 215-222.
4. D. F. Li, X. R. Li, H. T. Huang, Scalability of the surface-based DNA algorithm for 3-SAT, BioSystems 85 (2006) 95-98.
5. M. Ho, W. L. Chang, M. Guo, Fast parallel solution for set-packing and clique problems by DNA-based computing, IEICE Trans. Inf. Syst. E87-D (7) (2004) 1782-1788.
6. M. Ho, Fast parallel molecular solutions for DNA-based supercomputing: The subset-product problem, BioSystems 80 (2005) 233-250. (Pubitemid 40693497)
7. W. L. Chang, M. Guo, M. Ho, Fast parallel molecular algorithms for DNA-based computation, IEEE Trans. Nanobiosci. 4 (2005) 133-163.
8. W. L. Chang, M. Guo, Molecular solutions for the subset-sum problem on DNA-based supercomputing, BioSystems 73 (2004) 117-130. (Pubitemid 38175409)
9. Y. Li, C. Fang, Q. Ouyang, Genetic algorithm in DNA Computing: A solution to the maximal clique problem, Chinese Sci. Bull. 49 (2004) 967-971. (Pubitemid 44561214)
10. Q. Huiqin, L. Mingming, Z. Hong, Solve maximum clique problem by sticker model in DNA computing, Prog. Nat. Sci. 14 (2004) 1116-1121.
11. K. L. Li, F. J. Yao, J. Xu, Improved molecular solutions for the knapsack problem on DNA-based supercomputing, Chinese J. Comput. Res. Develop. 44 (2007) 1063-1070. (Pubitemid 47033154)
12. E. Horowitz, S. Sahni, Computing partitions with applications to the knapsack problem, J. ACM 21 (1974) 277-292.
13. S. Y. Hsieh, M. Y. Chen. A DNA-based graph encoding scheme with its applications to graph isomorphism problem, Appl. Math. Comput. 203 (2008) 502-512.
14. M. Guo, M. Ho, W. L. Chang. Fast parallel molecular solution to the dominating-set problem on massively parallel biocomputing, Parallel Comput. 30 (2004) 1109-1125.
15. B. Fu, R. Beigel, Length bounded molecular computing, BioSystems 52 (1999) 155-163. (Pubitemid 29518359)
16. B. Fu. Volume Bounded Molecular Computation, Ph. D. Thesis, Dep. Comput. Sci., Yale Univ., 1997
17. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
18. R. Graham, B. Rothschild, J. Spence, Ramsey theory, Elec. J. Comb. Dyn. Surv. 11 (2006) 3-36.
19. B. D. Mckay, K M Zhang, The value of the Ramsey number R (3, 8), J. Graph Theor. 16 (1992) 99-105.
20. I. M. Martínez-Pérez, K. H. Zimmermann, Parallel bioinspired algorithms for NP complete graph problems, J. Parallel Distrib. Comput. 69 (2009) 221-229.
21. R. E. Greennwood, A M Cleason, Combinatorial relations and chromatic graphs, Canadian J. Math. 7 (1955) 1-7.
22. J. E. Graver, J. Yackel, Some graph theoretic results associated with Ramsey's theorem, J. Comb. Theor. 4 (1968) 125-175.
23. J. G. Kalbfleisch, Chromatic Graphs and Ramsey's Theorem, Waterloo, Canada: Univ. Waterloo, 1966.
24. B. D. Mckay, S. P. Radziszowski, R (4, 5) =25, J. Graph Theor. 19 (1995) 309-322.
25. G. Exoo, Announcement: on the Ramsey numbers R (4, 6), R (5, 6) and R (3, 12), Ars Combin. 35 (1993) 85-85.
26. G. Exoo, Al ower bound for R (5, 5), J. Graph Theor. 13 (1989) 97-98.
27. T. Spenced, Upper bounds for Ramsey numbers via linear programming [EB/OL], (1993) [2007]. http://www.mathworld.woIfram.com/RamseyNumbor.html.
28. X. D. Xu, Z. Xie, G. Exoo, S. P. Radziszowski, Constructive lower bounds on classical multicolor Ramsey numbers, Elec. J. Comb. 11 (2004) 35-58.
29. S. D. Lu, The Experimentation of Molecular Biology, Peking Union Medical College Press. 1999
30. E. Horowitz, S. Sahni, Computing partitions with applications to the knapsack problem, J. ACM 21 (1974) 277-292.
31. n), J. Biomed. Biotech. 1 (2008) 1-10.
32. B. Richard, F. Bin, Solving intractable problems with DNA computing, Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity, 1998, pp. 154-168.