Development of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
نویسندگان
1 Ismail Akbari is a graduated student from Department of Industrial Engineering, Iran University of Science of Science and Technology, Tehran, Iran, (email: ismail.akbari80@gmail.com)
2 Corresponding Author, Reza Akbari is with the Department of Computer Engineering and Information Technology, Shiraz University of Technology, Shiraz, Iran, (email: akbari@sutech.ac.ir)
3 Vahid Zeighami is with the Department of Mathematics and Industrial Engineering, Ecole Polytechnique, de Montreal, Montreal, Quebec, Canada, (email: vahid.zeighami@polymtl.ca)
4 Koorush Ziarati is with the Department of Computer Science and Engineering, Shiraz University, Shiraz, Iran, (email: ziarati@shirazu.ac.ir)
doi
10.22060/eej.2012.42چکیده
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed by the basic PSO algorithm. Under this method, to balance between exploration and exploitation, at each iteration step, a local region is associated with each candidate particle, and a local exploration performed in this blob. The stochastic local search employs an intelligent repulsion/attraction mechanism to navigate a particle to explore this local region beyond that defined by the search algorithm to achieve a better solution. Over the successive iterations, the size of local region dynamically decreases. Also a non-linear dynamic inertia weight is introduced to further improve the performance of SPSO-Lk approach. The SPSO-Lk is tested on different sets of simulated and real nucleotide sequences to discover implanted DNA motifs. Experimental results show that the SPSO-Lk is effective, and provides competitive results in comparison with the performance of other algorithms investigated in this consideration.