DNA sequence optimization based on continuous particle swarm optimization for reliable DNA computing and DNA nanotechnology

Journal of Computer Science

Volumn 4, Issue 11, 2008, Pages 942-950

  Khalid, Noor Khafifah ^a   Ibrahim, Zuwairie ^a   Kurniawan, Tri Basuki ^a   Khalid, Marzuki ^a   Engelbrecht, Andries P ^b  

^a UNIVERSITI TEKNOLOGI MALAYSIA   (Malaysia)

^b UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

DNA sequence design; Optimization; Particle swarm optimization; User defined weights

Indexed keywords

EID: 60749123957     PISSN: 15493636     EISSN: None     Source Type: Journal    
DOI: 10.3844/jcssp.2008.942.950     Document Type: Article

References (32)

1. Arita, M., A. Nishikawa, M. Hagiya, K. Komiya, H. Gouzu and K. Sakamoto, 2000. Improving sequence design for DNA computing. Proceedings of the Conference on Genetic and Evolutionary Computation, July 8-12, Morgan Kaufmann, Las Vegas, Nevada, USA., pp: 875-882. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.3358.
2. Reece, R.J., 2004. Analysis of Genes and Genomes. 1st Edn., Wiley, New York, USA., ISBN: 10: 0470843802, pp: 490.
3. Adleman, L., 1994. Molecular computation of solutions to combinatorial problems. Science, 266: 1021-1024. http://www.ncbi.nlm.nih.gov/pubmed/ 7973651.
4. Kashiwamura, S., A. Kameda, M. Yamamoto and A. Ohuchi, 2004. Two-step search for DNA sequence design. Proceedings of the Conference on International Technical Circuits/Systems, Computers and Communications, July 7-9, Bo-Kwang Phoenix Park, Korea, E87-A: 1446-1453. http://ci.nii.ac.jp/naid/110003213054/.
5. Arita, M. and S. Kobayashi, 2002. DNA sequence design using templates. New Generat. Comput., 20: 263-277. http://portal.acm.org/ citation.cfm?id=639002.639007&coll=GUIDE&dl=GUIDE.
6. Kobayashi, S. and T. Kondo, 2002. On template method for DNA sequence design. Proceeding of 8th International Meeting on DNA Based Computers, June 10-13, Springer-Verlag, Berlin, pp: 205-214. http://portal.acm.org/ citation.cfm?id=647863.736629&coll=&dl=.
7. Kennedy, J. and R.C. Eberhart, 1995. Particle swarm optimisation. Proceeding of IEEE International Conference on Neural Networks, Nov. 27-Dec 1, IEEE Service Center, Perth, Australia, pp: 1942-1948. http://www.engr.iupui.edu/~shi/Coference/psopap4.html.
8. Kalyanmoy Deb, 2001. Multi-objective Evolutionary Optimization. 4th Edn., John Wiley and Sons, England, pp: 50.
9. Seeman, N.C. and N.R. Kallenbach, 1983. Design of immobile nucleic acid junctions. Biophys. J., 44: 201-209. http://www.ncbi.nlm.nih.gov/pubmed/ 6197102.
10. Seeman, N.C., 1990. De novo design of Sequences for nucleic acid structural engineering. J. Biomol. Struct. Dynam., 8: 573-581. http://www.ncbi.nlm.nih.gov/pubmed/2100519.
11. Baum, E.B., 1996. DNA sequences useful for computation. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.2306.
12. Hartemink, A.J., D.K. Gifford and J. Khodor, 1998. Automated constraint based nucleotide sequence selection for DNA computation. Proceeding 4th DIMACS Workshop DNA Based Computer, June 16-19, Philadelphia, Pennsylvania, USA., pp: 227-235. DOI: 10.1016/S0303-2647(99)00050-7.
13. Penchovsky, R. and J. Ackermann, 2003. DNA library design for molecular computation. J. Computat. Biol., 10: 215-229. http://www.ncbi.nlm.nih.gov/pubmed/12804092.
14. Tanaka, F., M. Naktsugawa, M. Yamamoto, T. Shiba and A. Ohuchi, 2002. Toward a general-purpose sequence design system in DNA computing Proceeding Congress Evolutionary Computing, May 12-17, IEEE Publisher, USA., pp: 73-78. DOI: 10.1109/CEC.2002.1006212.
15. Kirkpatrick, S.C.D., Gelatt Jr. and M.P. Vecchi, 1983. Optimization by simulated annealing. Science, 220: 671-680. http://www.ncbi.nlm.nih.gov/ pubmed/17813860.
16. Marathe, A., A.E. Condon and R.M. Corn, 1999. On combinatorial DNA word design. Proceedings of the 5th International Meeting on DNA Based Computers, June 14-15, Massachusetts Institute of Technology DIMACS, USA.
17. Feldkamp, U., S. Saghafi, W. Banzhaf and H. Rauhe, 2001. DNA sequence generator-A program for the construction of DNA sequences. Proceeding 7th International Workshop DNA Based Computing, pp: 179-188.
18. Frutos, A.G., A.J. Thiel, A.E. Condon, L.M. Smith and R.M. Corn, 1997. DNA computing at surfaces: Four base mismatch word design. Proceeding of the 3rd DIMACS Workshop DNA Based Computing, June 23-25, Philadelphia, PA., DIMACS, USA., pp: 238.
19. Deaton, R., R.C. Murphy, M. Garzon, D.T. Franceschetti and S.E. Stevens, 1996. Good Encodings for DNA-based solutions to combinatorial problems. Proceedings of the Second Annual Meeting on DNA Based Computers, June 10-12, Princeton University, DIMACS, USA., pp: 159-171. http://citeseerx.ist.psu.edu/showciting;jsessionid= 7DF7A3302BA04E1E1B704C547FC1BC5C?cid=58871.
20. Deaton, R., R.C. Murphy, J.A. Rose, M. Garzon, D.T. Franceschetti and S.E. Stevens, 1996. Genetic search for reliable encodings for DNA-based computation, Proceeding of the 1st Conference on Genetic Programming, July 28-31, California, USA., pp: 9-15. http://www.cs.bham.ac.uk/~wbl/ biblio/gp-html/deaton_1996ςreDNA.html.
21. Shin, S.Y. I.H. Lee, D. Kim and B.T. Zhang, 2005. Multi-objective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Trans. Evolut. Comput., 9: 143-158. DOI: 10.1109/TEVC.2005.844166.
22. Cui Guangzhao, Niu Yunyun, Wang Yangfeng, Zhang Xuncai and Pan Linqiang, 2007. A new approach based on PSO algorithm to find good computational encoding sequences. Progress Natural Sci., 17: 712-716. DOI: 10.1080/ 10002007088537464.
23. Shihua Zhou, Qiang Zhang, Jing Zhao and Jinsong Li, 2007. DNA encoding based on multi-objective particle swarm. J. Comput. Theoret Nanosci., 4: 1249-1252. DOI: 10.1166/jctn.2007.005.
24. Kurniawan, T.B., N.K. Khalid, Z. Ibrahim, M. Khalid and M. Middendorf, 2008. An ant colony system for DNA sequence design based on thermodynamics. Proceedings of the 4th IASTED International Conference Advances in Computer Science and Technology, Langkawi, Malaysia, pp: 144-149.
25. Das, T.K. and G.K. Venayagamoorthy, 2006. Optimal design of power system stabilizers using a small population based PSO. Power Engineering Society General Meeting, June 18-22, IEEE Compute Society, USA., pp: 7.
26. Cai, X. and D.C. Wunsch, 2005. Engine data classification with simultaneous recurrent network using hybrid PSO-EA algorithm. Proceeding of International Joint Conference on Neural Network, Montreal, Quebec, Canada. IEEE, July 31-Aug. 4, 4: 2319-2323. DOI: 10.1109/ IJCNN.2005.1556263.
27. Doctor, S., G.K. Venayagamoorthy and V.G. Gudise, 2004. Optimal PSO for collective robotic search applications. Cong. Evolutionary Computation (CEC 2004), 2: DOI: 1390-1395. 10.1109/CEC.2004.1331059.
28. Nenortaite, J. and R.D. Simutis, 2005. Decision-making model for stock markets based on particle swarm optimization algorithm. New Math. Natl. Comput., 1: 261-274. http://econpapers.repec.org/article/wsinmncxx/ v_3A01_3Ay_3A2005_3Ai_3A02_3Ap_3A261-274.htm.
29. Voss, M.S. and X. Feng, 2002. A new methodology for emergent system identification using Particle Swarm Optimization (PSO) and the Group Method of Data Handling (GMDH). Proceeding of Genetic and Evolutionary Computation Conference, July 9-13, Morgan Kaufmann Publishers, USA., pp: 1227-1232. http://citeseerx.ist.psu.edu/viewdoc/ summary?doi=10.1.1.13.5124.
30. SantaLucia, J., 1998. A unified view of polymer, dumbbell and oligonucleotide DNA nearest-neighbour thermodynamics. Proc. Natl Acad. Sci. USA., No. 95. pp: 1460-1465. http://www.ncbi.nlm.nih.gov/pubmed/ 9465037.
31. Eberhart, R.C. and Y. Shi, 2000. Comparing Inertia Weights and Constriction Factors in Particle Swarm Optimization. Proceedings of IEEE Congress Evolutionary Computation, July 16-19, San Diego, CA., USA., pp: 84-88. DOI: 10.1109/CEC.2000.870279.
32. Tanaka, F., M. Nakatsugawa, M. Yamamoto, T. Shiba and A. Ohuchi, 2001. Developing support system for sequence design in DNA computing. Proceeding 7th International Workshop DNA Based Computing, June 10-13, Springer-Verlag, Berlin, pp: 129-137. http://portal.acm.org/ citation.cfm?id=736483.