EGSA: a new enhanced gravitational search algorithm to resolve multiple sequence alignment problem

摘要

Multiple sequence alignment is a very important and useful tool for genomic analysis in many tasks in bioinformatics. However, finding an accurate alignment of DNA or protein sequences is very difficult since the computational effort required grows exponentially with the sequences number. In this paper, we propose a new sequence alignment algorithm based on gravitational search algorithm (GSA). The gravitational search algorithm (GSA) is a recent metaheuristic inspired from Newton's laws of universal gravitation and motion. Moreover, to avoid the convergence toward local optima, we enhance GSA behaviour by introducing a new mechanism based on simulated annealing concept. Such concept offers a good balance between the exploration and exploitation in GSA and can lead to good alignment quality for the MSA problem. The accuracy and efficiency of the proposed algorithm are compared with recent and well-known alignment methods using BAliBASE benchmark database. The analysis of the experimental results shows that the algorithm can achieve competitive solutions quality.