Genetic algorithm in DNA computing: A solution to the maximal clique problem

Chinese Science Bulletin

Volumn 49, Issue 9, 2004, Pages 967-971

  Li, Yuan ^a   Fang, Chen ^a   Ouyang, Qi ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

DNA computer; Genetic algorithm; NP complete problem

Indexed keywords

EID: 32644439830     PISSN: 10016538     EISSN: 18619541     Source Type: Journal    
DOI: 10.1360/03we0193     Document Type: Article

References (17)

1. Ruben, A. J., Landweber, L. F., The past, present and future of molecular computing, Nature Reviews Molecular Cell Biology, 2000, 1: 69-72.
2. Adleman, L., Molecular computation of solutions to combinatorial problems, Science, 1994, 266: 1021-1024.
3. Ouyang, Q., Kaplan, P. D., Liu S. et al., DNA solution of the maximal clique problem, Science, 1997, 278: 446-449.
4. Braich, R. S., Chelyapov, N., Johnson, C. et al., Solution of a 20-variable 3-SAT problem on a DNA computer, Science, 2002, 296: 499-502.
5. Faulhammer, D., Cukras, A. R., Lipton, R. J. et al., Molecular computation: RNA solutions to chess problems, Proc. Natl. Acad. Sci., 2000, U.S.A. 97: 1385-1389.
6. Benenson, Y., Paz-Elizur, T., Adar, R. et al., Programmable and autonomous computing machine made of biomolecules, Nature, 2001, 414: 430-434.
7. Liu, Q., Wang, L., Frutos, A. G. et al., DNA computing on surfaces, Nature, 2000, 403: 175-179.
8. Ogihara, M., Ray, A., DNA computing on a chip, Nature, 2000, 403: 143-144.
9. Sakamoto, K., Gouzu, H., Komiya, K. et al., Molecular computation by DNA hairpin formation, Science, 2000, 288: 1223-1226.
10. Wang, L., Hall, J. G., Lu, M. et al., A DNA computing readout operation based on structure-specific cleavage, Nat. Biotechnol., 2001, 19: 1053-1059.
11. Zimmermann, K. -H., On applying molecular computation to binary linear codes, IEEE Trans. Inform. Theory, 2002, 48: 505-510.
12. Impagliazzo, R., Paturi, R., Zane, F., Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 2001, 23: 512-530 (doi: 10.1006/jcss.2001.1774).
13. Holland, J. H., Genetic algorithm, Scientific American, 1992, 267(1): 66-72.
14. Foster, J. A., Evolutionary computation, Nat. Rev. Genet., 2001, 2: 428-436.
15. Chiu, D. T., Pezzoli, E., Wu, H. et al., Using three-dimensional microfluidic networks for solving computationally hard problems, Proc. Natl. Acad. Sci. U.S.A., 2001, 98: 2961-2966.
16. Kaplan, P. D., Ouyang, Q., Thaler, D. S. et al., Parallel overlap assembly for the construction of computational DNA libraries, J. Theor. Biol., 1997, 188: 333-341 (doi: 10.1006/jtbi.1997.0475).
17. Arita, M., Kobayashi, S., The power of sequence design in DNA computing, ICCIMA 2001: Proceedings of 4th International Conference on Computational Intelligence and Multimedia Applications, 163-167.