A multiobjective swarm intelligence approach based on artificial bee colony for reliable DNA sequence design

Engineering Applications of Artificial Intelligence

Volumn 26, Issue 9, 2013, Pages 2045-2057

  Chaves González, José M ^a   Vega Rodríguez, Miguel A ^a   Granado Criado, José M ^a  

^a UNIVERSITY OF EXTREMADURA   (Spain)

Author keywords

Artificial Bee Colony; DNA sequence design; Molecular computing; Multiobjective evolutionary algorithm; Multiobjective optimization; Swarm intelligence

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; CALCULATIONS; DNA; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; SELF ASSEMBLY; SWARM INTELLIGENCE;

ARTIFICIAL BEE COLONIES; DNA SEQUENCE DESIGN; ENGINEERING APPLICATIONS; MOLECULAR COMPUTING; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; MULTIOBJECTIVE APPROACH; NON- DOMINATED SORTING GENETIC ALGORITHMS;

DNA SEQUENCES;

EID: 84888343199     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2013.04.011     Document Type: Article

References (46)

1. Adleman, L. M., 1994. Molecular computation of solutions to combinatorial problems. Science 266, 1021-1024.
2. Arita, M., Kobayashi, S., 2002. DNA sequence design using templates. New Gener. Comput. 20, 263-277.
3. Arita, M., Nishikawa, A., Hagiya, M., Komiya, K., Gouzu, H., Sakamoto, K., 2000. Improving sequence design for DNA computing. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 875-882.
4. Brenneman, A., Condon, A., 2002. Strand design for biomolecular computation. Theor. Comput. Sci. 287, 39-58.
5. Coello, C. A., Van Veldhuizen, D. A., Lamont, G. B., 2002. Evolutionary algorithms for solving multi-objective problems, genetic algorithms and evolutionary computation, Springer, New York, NY, USA.
6. Cui, G., Li, X., 2010. The optimization of DNA encodings based on modified PSO/GA algorithm. In: Proceedings of the International Conference on Computer Design and Applications, pp. 609-614.
7. Deaton, R., Murphy, R. C., Garzon, M., Franceschetti, D. R., S. E. Stevens, Jr., 1996. Good encodings for DNA-based solutions to combinatorial problems. In: Proceedings of the 2nd Annual Meeting DNA Based Computation, pp. 247-258.
8. Deaton, R., Garzon, M., Murphy, R. C., Rose, J. A., Franceschetti, D. R., Stevens Jr., S. E., 1998. Reliability and efficiency of a DNA-based computation. Phys. Rev. Lett. 80(2), 417-420.
9. Deaton, R., Chen, J., Bi, H., Garzon, M., Rubin, H., Wood, D. H., 2002a. A PCR-based protocol for in vitro selection of noncrosshybridizing olgionucleotides. In: Proceedings of the 8th International Workshop DNA Based Computers, pp. 196-204.
10. Deaton, R., Chen, J., Bi, H., Rose, J. A., 2002b. A software tool for generating noncrosshybridization libraries of DNA oligonucleotides. In: Proceedings of the 8th International Workshop DNA Based Computers, pp. 252-261.
11. Deb, K., 2001. Multi-objective optimization using evolutionary algorithms. John Wiley & Sons, Chichester, West Sussex, England.
12. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., Fast, A., 2000. Elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182-197.
13. Deb, K., Pratap, A., Meyarivan, T., 2001. Controlled elitist nondominated sorting genetic algorithms for better convergence. In: Proceedings of the 1st International Conference Evolutionary Multicriterion Optimization (EMO), pp. 284-298.
14. Faulhammer, D., Cukras, A. R., Lipton, R. J., Landweber, L. F., 2000. Molecular computation: RNA solutions to chess problems. Proc. Natl. Acad. Sci. USA 97, 1385-1389.
15. Feldkamp, U., Saghafi, S., Banzhaf, W., Rauhe, H., 2001. DNA sequence generator- A program for the construction of DNA sequences. In: Proceedings of the 7th International Workshop DNA Based Computers, pp. 179-188.
16. Frutos, A. G., Thiel, A. J., Condon, A. E., Smith, L. M., Corn, R. M., 1997. DNA computing at surfaces: four base mismatch word design. In: Proceedings of the 3rd DIMACS Workshop DNA Based Computers, p. 238.
17. Garzon, M. H., Deaton, R. J., 1999. Biomolecular computing and programming. IEEE Trans. Evol. Comput. 3, 236-250.
18. Hartemink, A. J., Gifford, D. K., Khodor, J., 1998. Automated constraint based nucleotide sequence selection for DNA computation. In: Proceedings of the 4th DIMACS Workshop DNA Based Computers, pp. 227-235.
19. Heitsch, C. E., Condon, A. E., Hoos, H. H., 2002. From RNA secondary structure to coding theory: a combinatorial approach. In: Proceedings of the 8th International Workshop DNA Based Computers, pp. 215-228.
20. Hongyan, Z., Xiyu, L., 2002. Improved genetic algorithm for designing DNA sequences. In: Proceedings of the 2nd International Symposium on Electronic Commerce and Security, pp. 514-518.
21. Ibrahim, Z., Khalid, N. K., Buyamin, S., Ibrahim, I., Mukred, J. A. A., Yusof, Z. M., Mohamad, M. S., Mokhtar, N., Saaid, M. F. M., Engelbrecht, A., 2012. DNA sequence design for DNA computation based on binary particle swarm optimization. Int. J. Innovative Comp. Inf. Control 8(5B), 3441-3450.
22. Karaboga, D., Akay, B., 2009. A survey: algorithms simulating bee swarm intelligence. Artif. Intell. Rev. 31, 61-85.
23. Khalid, N. K., Kurniawanl, T. B., Ibrahim, Z., Yusof, Z. M., Khalid, M., Engelbrecht, A. P., 2008. A model to optimize DNA sequences based on particle swarm pptimization. In: Proceedings of the 2nd Asia International Conference on Modeling and Simulation, pp. 534-539.
24. Knowles, J., Corne, D., 1999. The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimization. In: Proceedings of the Congress on Evolutionary Computation (CEC), pp. 98-105.
25. Kurniawan, T. B., Khalid, N. K., Ibrahim, Z., Khalid, M., Middendorf, M., 2008. Evaluation of ordering methods for DNA sequence design based on ant colony system. In: Proceedings of the 2nd Asia International Conference on Modeling and Simulation, pp. 905-910.
26. Kurniawan, T. B., Khalid, N. K., Ibrahim, Z., Abidin, M. S. Z., Khalid, M., 2009. Sequence design for direct-proportional length-based DNA computing using populationbased ant colony optimization. In: Proceedings of the ICROS-SICE International Joint Conference, pp. 1486-1491.
27. Lindman, H. R., 1974. In: Erlbaum (Ed.), Analysis of Variance in Complex Experimental Designs. W. H. Freeman & Co, San Francisco, CA, USA.
28. Liu, W., Wang, S., Gao, L., Zhang, F., Xu, J., 2003. DNA sequence design based on template strategy. J. Chem. Inf. Comput. Sci. 43, 2014-2018.
29. Lucia Jr., J. Santa, 1998. A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. Proc. Nat. Acad. Sci. USA 95, 1460-1465.
30. Marathe, A., Condon, A. E., Corn, R. M., 1999. On combinatorial DNA word design. In: Proceedings of the 5th DIMACS Workshop DNA Based Computers, pp. 75-89.
31. Mustaza, S. M., Abidin, A. F. Z., Ibrahim, Z., Shamsudin, M. A., Husain, A. R., Mukred, J. A. A., 2011. A modified computational model of ant colony system in DNA sequence design. In: Proceedings of the IEEE Student Conference on Research and Development (SCOReD), pp. 169-173.
32. Penchovsky, R., Ackermann, J., 2003. DNA library design for molecular computation. J. Comput. Bio. 10(2), 215-229.
33. Ruben, A. J., Freeland, S. J., Landweber, L., 2001. PUNCH: an evolutionary algorithm for optimizing bit set selestion. In: Proceedings of the 7th InternationalWorkshop DNA Based Computers, pp. 260-270.
34. Sheskin, D. J., 2007. Handbook of Parametric and Nonparametric Statistical Procedures, 4th ed. Chapman & Hall/CRC Press, New York.
35. Shin, S.-Y, Kim, D.-M., Lee, I.-H., Zhang, B.-T., 2002. Evolutionary sequence generation for reliable DNA computing. In: Proceedings of the Congress on Evolutionary Computation (CEC), pp. 79-84.
36. Shin, S.-Y, Lee, I.-H., Kim, D., Zhang, B.-T., 2005. Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Trans. Evolut. Comput. 9(2), 143-158.
37. Tanaka, F., Nakatsugawa, M., Yamamoto, M., Shiba, T., Ohuchi, A., 2011. Developing support system for sequence design in DNA computing. In: Proceedings of the 7th International Workshop DNA Based Computers, pp. 340-349.
38. Tanaka, F., Nakatsugawa, M., Yamamoto, M., Shiba, T., Ohuchi, A., 2002. Toward a general-purpose sequence design system in DNA computing. In: Proceedings of the Congress on Evolutionary Computation (CEC), pp. 73-78.
39. Wang, Y, Cai, Z., Guo, G., Zhou, Y, 2007. Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans. Syst. Man Cybern. B Cybern. 37(3), 560-575.
40. Wang, Y, Shen, Y; Zhang, X., Cui, G., 2009. DNA codewords design using the improved NSGA-II algorithms. In: Proceedings of the 4th International Conference on Bio-Inspired Computing, pp. 48-52.
41. Wetmur, J. G., 1991. DNA probes: applications of the principles of nucleic acid hybridization. Crit. Rev. Biochem. Mol. Biol. 26, 227-259.
42. Xiao, J., Cheng, Z., 2011. DNA sequences optimization based on gravitational search algorithm for reliable DNA computing. In: Proceedings of the 6th International Conference on Bio-Inspired Computing, pp. 103-107.
43. Xu, C, Zhang, Q., Wang, B., Zhang, R., 2008. Research on the DNA sequence design based on GA/PSO algorithms. In: Proceedings of the 2nd International Conference on Bioinformatics and Biomedical Engineering, pp. 816-819.
44. Zhang, B.-T., Shin, S.-Y, 1998. Molecular algorithms for efficient and reliable DNA computing. In: Proceedings of the Genentic Programming Conference, pp. 735-742.
45. Zhang, Q., Wang, B., Wei, X., Fang, X., Zhou, C, 2010. DNA word set design based on minimum free energy. IEEE Trans. Nanobiosci. 9(4), 273-277.
46. Zitzler, E., Deb, K., Thiele, L., 2000. Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173-195.