Implementation of Binary Particle Swarm Optimization for DNA Sequence Design

In DNA based computation and DNA nanotechnology, the design of good DNA sequences has turned out to be an essential problem and one of the most practical and important research topics. Basically, the DNA sequence design problem is a multi-objective problem, and it can be evaluated using four objective functions, namely, H measure , similarity, continuity, andhairpin . There are several ways to solve a multi-objective problem, such as value function method, weighted sum method, and using evolutionary algorithms. However, in this paper, common method has been used, namely weighted sum method to convert DNA sequence design problem into single objective problem. Binary particle swarm optimization (BinPSO) is proposed to minimize the objective in the problem, subjected to two constraints: melting temperature and GC content . Based on experiments and researches done, 20 particles are used in the implementation of the optimization process, where the average values and the standard deviation for 100 runs are shown along with comparison to other existing methods. The results obtained verified that BinPSO can suitably solve DNA sequence design problem using the proposed method and model, comparatively better than other approaches.

[1]  R. J. Reece.  Analysis of Genes and Genomes , 2004 .

[2]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[3]  Robert Penchovsky,et al.  DNA Library Design for Molecular Computation , 2003, J. Comput. Biol..

[4]  Amit Marathe,et al.  On combinatorial DNA word design , 1999, DNA Based Computers.

[5]  D. Gifford,et al.  Automated constraint-based nucleotide sequence selection for DNA computation. , 1999, Bio Systems.

[6]  Byoung-Tak Zhang,et al.  Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing , 2005, IEEE Trans. Evol. Comput..

[7]  Masami Hagiya,et al.  Improving Sequence Design for DNA Computing , 2000, GECCO.

[8]  J. SantaLucia,et al.  A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[10]  Satoshi Kobayashi,et al.  DNA sequence design using templates , 2002, New Generation Computing.

[11]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[12]  Jing Zhao,et al.  DNA Encodings Based on Multi-Objective Particle Swarm , 2007 .

[13]  Wolfgang Banzhaf,et al.  DNASequencesGenerator: A Program for the Construction of DNA Sequences , 2001, DNA.

[14]  Satoshi Kobayashi,et al.  On Template Method for DNA Sequence Design , 2002, DNA.

[15]  Pan Linqiang,et al.  A new approach based on PSO algorithm to find good computational encoding sequences , 2007 .

[16]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  Masahito Yamamoto,et al.  Towards a general-purpose sequence design system in DNA computing , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[19]  Marzuki Khalid,et al.  An Ant Colony System for DNA sequence design based on thermodynamics , 2008 .

[20]  N C Seeman,et al.  Design of immobile nucleic acid junctions. , 1983, Biophysical journal.

[21]  N. Seeman.  De novo design of sequences for nucleic acid structural engineering. , 1990, Journal of biomolecular structure & dynamics.

[22]  Max H. Garzon,et al.  Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.

[23]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[24]  Masahito Yamamoto,et al.  Two-Step Search for DNA Sequence Design , 2003 .