A membrane evolutionary algorithm for DNA sequence design in DNA computing

Chinese Science Bulletin

Volumn 57, Issue 6, 2012, Pages 698-706

  Xiao, Jian Hua ^a   Zhang, Xing Yi ^b   Xu, Jin ^c  

^a NANKAI UNIVERSITY   (China)

^b ANHUI UNIVERSITY   (China)

^c PEKING UNIVERSITY   (China)

Author keywords

DNA computing; DNA sequence design; membrane computing; P system

Indexed keywords

EID: 84863057813     PISSN: 10016538     EISSN: 18619541     Source Type: Journal    
DOI: 10.1007/s11434-011-4928-7     Document Type: Article

References (40)

1. Paun G H. Computing with membranes. Technical Report. Finland: Turku Center for Computer Science, 1998.
2. Pan L Q, Paun G. Spiking neural P systems: An improved normal form. Theor Comput Sci, 2010, 411: 906-918.
3. Wang J, Hoogeboom H J, Pan L, et al. Spiking neural P systems with weights. Neural Comput, 2010, 22: 2615-2646.
4. Pan L Q, Zeng X X, Zhang X Y. Time-free spiking neural P systems. Neural Comput, 2011, 23: 1-23.
5. Alhazov A, Martin-Vide C, Pan L Q. Solving a PSPACE-complete problem by Prelognizing systems with restricted active membranes. Fund Inform, 2003, 58: 67-77.
6. Pan L Q, Martin-Vide C. Further remark on P systems with active membranes and two polarizations. J Parallel Distr Com, 2006, 66: 867-872.
7. Pan L Q, Martin-Vide C. Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes. J Parallel Distr Com, 2005, 65: 1578-1584.
8. Pan L Q, Alhazov A. Solving HPP and SAT by P systems with active membranes and separation rules. Acta Inform, 2006, 43: 131-145.
9. Pan L Q, Perez-Jimenez M J. Computational complexity of tissue-like P systems. J Complexity, 2010, 26: 296-315.
10. Srinivas M, Patnaik L M. Genetic algorithms: A survey. Computer, 1994, 27: 17-26.
11. Back T, Hammel U, Schwefel H P. Evolutionary computation: Comments on the history and current state. IEEE T Evolut Comput, 1997, 1: 3-17.
12. Paun G H. Further twenty six open problems in membrane computing. In: Gutierrez-Naranjo M A, Riscos-Nunez A, Romero-Campero F J, eds. Proceedings of the 3rd Brainstorming Week on Membrane Computing, 2005 January 31-February 4. Sevilla: Fenix Editora, 2005. 249-262.
13. Nishida T Y. Membrane algorithms: Approximate algorithms for NP-complete optimization problems. In: Ciobanu G, Paun G, Perez-Jimenez M J, eds. Applications of Membrane Computing. Berlin: Springer-Verlag, 2006. 303-314.
14. Nishida T Y. Membrane algorithms. LNCS, 2006, 3850: 55-56.
15. Leporati A, Pagani D. A membrane algorithm for the min storing problem. LNCS, 2006, 4361: 443-462.
16. Zhang G X, Gheorghe M, Wu C Z. A quantum-inspired evolutionary algorithm based on P systems for knapsack problem. Fund Inform, 2008, 87: 93-116.
17. Zhang G X, Liu C X, Rong H N. Analyzing radar emitter signals with membrane algorithms. Math Comput Model, 2010, 52: 1997-2010.
18. Zaharie D, Ciobanu G. Distributed evolutionary algorithms inspired by membranes in solving continuous optimization problems. LNCS, 2006, 4361: 536-553.
19. Adleman L M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266: l021-1024.
20. Lipton R. DNA solution of hard computational problems. Science, 1995, 268: 542-545.
21. 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.
22. Zimmermann K. Efficient DNA sticker algorithms for NP-complete graph problems. Comput Phys Commun, 2002, 144: 297-309.
23. Ouyang Q, Kaplan P D, Liu S, et al. DNA solution of the maximal clique problem. Science, 1997, 278: 446-449.
24. Zhang C, Yang J, Xu J, et al. A DNA length reducing computing model for maximum independent set problem. Chin Sci Bull, 2010, 55: 890-896.
25. Garzon M, Deaton R, Neathery P, et al. On the encoding problem for DNA computing. In: Rubin H, Wood D H, eds. Proceedings of 3rd DIMACS Workshop on DNA Based Computers, 1997 June 23-27, Philadelphia. Providence: American Mathematical Society, 1997. 230-237.
26. Sager J, Stefanovic D. Designing nucleotide sequences for computation: A survey of constraints. LNCS, 2006, 3892: 275-289.
27. Marathe A, Condon A E, Corn R M. On combinatorial DNA word design. J Comput Biol, 2001, 8: 201-219.
28. Frutos A G, Thiel A J, Condon A E, et al. DNA computing at surfaces: Four base mismatch word designs. In: Rubin H, Wood D H, eds. Proceedings of 3rd DIMACS Workshop on DNA Based Computers, 1997 June 23-27, Philadelphia. Providence: American Mathematical Society, 1997. 238.
29. Arita M, Nishikawa A, Hagiya M, et al. Improving sequence design for DNA computing. In: Whitley L D, Goldberg D E, Cantu-Paz E, eds. Proceedings of Genetic and Evolutionary Computation, 2000 July 8-12, Las Vegas. San Fransisco: Morgan Kaufmann, 2000. 875-882.
30. Tanaka F, Nakatsugawa M, Yamamoto M, et al. Developing support system for sequence design in DNA computing. LNCS, 2002, 2340: 129-137.
31. Cui G Z, Niu Y Y, Wang Y F, et al. A new approach based on PSO algorithm to find good computational encoding sequences. Prog Nat Sci, 2007, 17: 712-716.
32. Wang W, Zheng X D, Zhang Q, et al. The optimization of DNA encodings based on GA/SA algorithm. Prog Nat Sci, 2007, 17: 739-744.
33. Qiu Q R, Mukre P, Bishop M, et al. Hardware acceleration for thermodynamic constrained DNA code generation. LNCS, 2008, 4848: 201-210.
34. Dyachkov A G, Macula A, Rykov V, et al. DNA codes based on stem similarities between DNA sequences. LNCS, 2008, 4848: 146-151.
35. Kawashimo S, Ono H, Sadakane K, et al. Dynamic neighborhood searches for thermodynamically designing DNA sequence. LNCS, 2008, 4848: 130-139.
36. Zhang X C, Wang Y F, Cui G Z, et al. Application of a novel IWO to the design of encoding sequences for DNA computing. Comput Math Appl, 2009, 57: 2001-2008.
37. Wetmur J G. DNA probes: Applications of the principles of nucleic acid hybridization. Crit Rev Biochem Mol, 1991, 26: 227-259.
38. Shin S Y, Lee I H, Kim D, et al. Multi-objective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE T Evolut Comput, 2005, 9: 143-158.
39. Meng W C, Qiu J J, Zhang Y H. Immune chaotic algorithm for constrained optimization problems (in Chinese). J Zhejiang Univ, 2007, 41: 299-303.
40. Xiao J H, Xu J, Chen Z H, et al. A hybrid quantum chaotic swarm evolutionary algorithm for DNA encoding. Comput Math Appl, 2009, 57: 1949-1958.