EGSA: a new enhanced gravitational search algorithm to resolve multiple sequence alignment problem
by Elamine Zemali; Abdelmadjid Boukra
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 6, No. 1/2, 2018

Abstract: 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.

Online publication date: Fri, 06-Apr-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Engineering Informatics (IJIEI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com