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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01789954
Contributor : Hal Ifip <>
Submitted on : Friday, May 11, 2018 - 3:10:54 PM
Last modification on : Friday, October 5, 2018 - 10:00:02 PM
Long-term archiving on : Monday, September 24, 2018 - 1:21:26 PM

File

339159_1_En_12_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

69

Files downloads

39