%0 Conference Proceedings
%T Multiple Guide Trees in a Tabu Search Algorithm for the Multiple Sequence Alignment Problem
%+ University of M'sila / Université Mohamed Boudiaf - M'sila (Uni M'sila)
%A Mehenni, Tahar
%Z Part 5: Computational Intelligence: BioInformatics
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 5th International Conference on Computer Science and Its Applications (CIIA)
%C Saida, Algeria
%Y Abdelmalek Amine
%Y Ladjel Bellatreche
%Y Zakaria Elberrichi
%Y Erich J. Neuhold
%Y Robert Wrembel
%I Springer International Publishing
%3 Computer Science and Its Applications
%V AICT-456
%P 141-152
%8 2015-05-20
%D 2015
%R 10.1007/978-3-319-19578-0_12
%K Multiple sequence alignment
%K Tabu search
%K Neighborhood
%K Guide tree
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 5
%2 https://inria.hal.science/hal-01789954/document
%2 https://inria.hal.science/hal-01789954/file/339159_1_En_12_Chapter.pdf
%L hal-01789954
%U https://inria.hal.science/hal-01789954
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-AICT-456
%~ IFIP-CIIA