The optimization of DNA encodings based on modified PSO/GA algorithm

2010 International Conference on Computer Design and Applications, ICCDA 2010

Volumn 1, Issue , 2010, Pages

  Cui, Guangzhao ^a   Li, Xiaoguang ^a  

^a ZHENGZHOU UNIVERSITY OF LIGHT INDUSTRY   (China)

Author keywords

DNA coding; DNA computing; Modified particle swarm optimization genetic algorithm; Muti objective optimization

Indexed keywords

BIOINFORMATICS; CALCULATIONS; DNA; MULTIOBJECTIVE OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO);

CONSTRAINED TERMS; DNA CODING; DNA ENCODING; DNA-COMPUTING; MODIFIED PARTICLE SWARM OPTIMIZATION/GENETIC ALGORITHM; MUTI-OBJECTIVE OPTIMIZATION; OPTIMIZATION GENETIC ALGORITHMS; PARTICLE SWARM; SWARM OPTIMIZATION;

DNA SEQUENCES;

EID: 77955897593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3724/sp.j.1016.2010.00311     Document Type: Conference Paper

References (13)

1. Adleman L.M. Molecular Computation of Solution to Combinatorial problems[J]. Science. 1994, 66 (11):1021-1024.
2. Adleman L.M. On Constructing a Molecular Computer. Technical Report TR 79-387,Computer science Department, University of Southern California, USA, January 1995.
3. Deaton R, Garzon M. Thermodynamic constraints on DNA-based computing [A]. In Gheorghe Paun editor[C], Computing with BioMolecules, Springer-Verlag, 1998, 138-152.
4. Frutos A G, Liu Q, Thiel A J etc. Demonstration of a word design strategy for DNA computing on surfaces[J]. Nucleic Acids Res, 1997, 25(23): 4748-4757.
5. Feldkamp U, Banzhaf W, Rauhe H, et al. A DNA sequence compiler. Proceedings of 6th DIMACS Workshop on DNA Based Computers,2000
6. Deaton R.. A DNA Based Implementation of an Evolutionary Search for Good Encodings for DNA Computation. Proceeding of 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, IN, USA, 13-16 April 1997: 267-271.
7. Deaton R J,Murphy R C, Garzon M H, et al. Good encodings for DNA-based solutions to combinatorial problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science,1999,44:247-258.
8. Guangzhao Cui, Yunyun Niu, Yanfeng Wang, et al. A new approach based on PSO algorithm to find good computational encoding sequences. Progress in Natural Science , 2007, 17(6): 712-716.
9. Guangzhao Cui, Limin Qin, et al. Modified PSO algorithm for solving planar graph coloring problem. Progress in Natural Science, 2008,3(18):353-357.
10. Shin SY, Lee I H, Kim D, et al. Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing[A]. IEEE Transactions On Evolutionary Computation[C], 2005, 9: 143-158. (Pubitemid 40573248)
11. F. tanaka, M. Nakatsugawa, M.Yamamoto, et al. Developing support system for sequence design in DNA computing. Proceedings of the 7th International Workshop DNA-Based Computers, Tampa, FL, USA, June 2001, 340-349
12. Kennedy J, Eberhard R. A discrete binary version of the particle swarm optimization. In: Proceedings of the conference on system, man, and cybernetics. USA: IEEE Service Center; 1997.p. 4104-8.
13. Fatih M and Liang Y. A binary particle swarm optimization algorithm for lot sizing problem. Journal of Economic and Social Research, 2003, 5(2): 1-20