z-logo
open-access-imgOpen Access
Simulated Annealing with Previous Solutions Applied to DNA Sequence Alignment
Author(s) -
Ernesto Liñán-García,
Lorena Marcela Gallegos-Araiza
Publication year - 2012
Publication title -
isrn artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2090-7443
pISSN - 2090-7435
DOI - 10.5402/2012/178658
Subject(s) - simulated annealing , annealing (glass) , adaptive simulated annealing , algorithm , mathematical optimization , sequence (biology) , computer science , biological system , mathematics , materials science , biology , genetics , composite material
A new algorithm for solving sequence alignment problem is proposed, which is named SAPS (Simulated Annealing with Previous Solutions). This algorithm is based on the classical Simulated Annealing (SA). SAPS is implemented in order to obtain results of pair and multiple sequence alignment. SA is a simulation of heating and cooling of a metal to solve an optimization problem. In order to select randomly a current solution, SAPS algorithm chooses a solution from solutions that have been previously generated within the Metropolis Cycle. This simple change has led to increase the quality of the solution to the problem of aligning genomic sequences with respect to the classical Simulated Annealing algorithm. The parameters of SAPS, for certain instances, are tuned by an analytical method, and some parameters have experimentally been tuned. SAPS has generated high-quality results in comparison with the classical SA. The instances used are specific genes of the AIDS virus.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom