Multiple Guide Trees in a Tabu Search Algorithm for the Multiple Sequence Alignment Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Multiple Guide Trees in a Tabu Search Algorithm for the Multiple Sequence Alignment Problem

Abstract

Nowadays, Multiple Sequence Alignment (MSA) approaches do not always provide consistent solutions. In fact, alignments become increasingly difficult when treating low similarity sequences. Tabu Search is a very useful meta-heuristic approach in solving optimization problems. For the alignment of multiple sequences, which is a NP-hard problem, we apply a tabu search algorithm improved by several neighborhood generation techniques using guide trees. The algorithm is tested with the BAliBASE benchmarking database, and experiments showed encouraging results compared to the algorithms studied in this paper.
Fichier principal
Vignette du fichier
339159_1_En_12_Chapter.pdf (633.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01789954 , version 1 (11-05-2018)

Licence

Attribution

Identifiers

Cite

Tahar Mehenni. Multiple Guide Trees in a Tabu Search Algorithm for the Multiple Sequence Alignment Problem. 5th International Conference on Computer Science and Its Applications (CIIA), May 2015, Saida, Algeria. pp.141-152, ⟨10.1007/978-3-319-19578-0_12⟩. ⟨hal-01789954⟩
86 View
150 Download

Altmetric

Share

Gmail Facebook X LinkedIn More