Abstract
The process of discovering short recurring patterns in DNA called DNA motif. DNA motif is an important part to study the biological cell functions. The main challenging of DNA motif is the running time to identify the motif where it increases with the length of motif and the number of mutations. Particle swarm optimization (PSO) is one of the efficient techniques to find an approximate solution using global optimization technique. We propose a PSO algorithm to find DNA motif. The experimental study on artificial data shows that the running time of the proposed algorithm is faster than recent proposed algorithms. The proposed algorithm is also compared to voting and hybrid algorithms for performance measure. In addition, the accuracy of the proposed algorithm is 90%. Finally, we apply the proposed algorithm on real data includes PDR3, GAL4, MATalpha2, and MCB. (C) 2017 The Authors. Published by IASE.