By Topic

Multiple sequence alignment using genetic algorithm and simulated annealing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
M. F. Omar ; Sch. of Comput. Sci., Univ. Sains Malaysia, Penang, Malaysia ; R. A. Salam ; N. A. Rashid ; R. Abdullah

This paper presents the combination of genetic algorithm and simulated annealing to solve multiple sequence alignment (MSA) assignment. Genetic algorithm will try to find a new region of feasible solution while simulated annealing will act as an aligning improver. There are several aspects that must be taken into consideration such as the representation, evaluation function and operator. Simulated annealing also helps to prevent local minima problem. Sequence similarity plays a major role in Bioinformatics and molecular biology. Significant results were produced from the prealignment and genetic algorithm phase.

Published in:

Information and Communication Technologies: From Theory to Applications, 2004. Proceedings. 2004 International Conference on

Date of Conference:

19-23 April 2004