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.
Chapter PDF
Similar content being viewed by others
References
Abbas, A., Holmes, S.: Bioinformatics and management science: some common tools and techniques. Operations Research 52(2), 165–190 (2004)
Bahr, A., Thompson, J.D., Thierry, J.C., Poch, O.: BAliBASE (benchmark alignment database): enhancements for repeats, transmembrane sequences and circular permutations. Nucleic Acids Res. 29(1), 323–326 (2001)
Blum, C., Valles, M.Y., Blesa, M.J.: An ant colony optimization algorithm for DNA sequencing by hybridization. Computers and Operations Research 38, 3620–3635 (2008)
Cutello, V., Nicosia, G., Pavone, M., Prizzi, I.: Protein multiple sequence alignment by hybrid bio-inspired algorithms. Nucleic Acids Research 39(6), 1980–1990 (2010)
Do, C., Mahabhashyam, M., Brudno, M., Batzoglou, S.: ProbCons: Probabilistic consistency-based multiple sequence alignment. Genome Res. 15(2), 330–340 (2005)
Edgar, R.: MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 32, 1792–1797 (2004)
Feng, D., Doolittle, R.: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. Journal of Molecular Evolution 24(4), 351–360 (1987)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Glover, F., Taillard, E., de Werra, D.: A user’s guide to tabu search. Ann. Oper. Res. 41, 3–28 (1993)
Gotoh, O.: Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. J. Mol. Biol. 264, 823–838 (1996)
Gupta, S.K., Kececioglu, J.D., Schaffer, A.A.: Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Comp. Biol. 2(3), 459–472 (1995)
Higgins, D.G., Taylor, W.R.: Multiple sequence alignment, Protein Structure Prediction -Methods and Protocols. Humana Press (2000)
Kemena, C., Notredame, C.: Upcoming challenges for multiple sequence alignment methods in the high-throughput era. Bioinformatics 25, 2455–2465 (2009)
Kim, J., Pramanik, S., Chung, M.J.: Multiple sequence alignment using simulated annealing. Comp. Applic. Biosci. 10(4), 419–472 (1994)
Lalwani, S., Kumar, R., Gupta, N.: A review on particle swarm optimization variants and their applications to multiple sequence alignments. Journal of Applied Mathematics and Bioinformatics 3(2), 87–124 (2013)
Layeb, A., Selmane, M., Bencheikh ELhoucine, M.: A new greedy randomized adaptive search procedure for multiple sequence alignment. International Journal of Bioinformatics Research and Applications (2011)
Lightner, C.: A Tabu Search Approach to Multiple Sequence Alignment. Ph.D. thesis, North Carolina State University, Raleigh, North Carolina (2008)
Lipman, D., Altschul, S., Kececioglu, J.: A tool for multiple sequence alignment. Proc. Natl. Acad. Sci. 86, 4412–4415 (1989)
Notredame, C., Higgins, D.G.: SAGA: Sequence alignment by genetic algorithm. Nucl. Acids Res. 24, 1515–1524 (1996)
Notredame, C., Higgins, D., Heringa, J.: T-Coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 302, 205–217 (2000)
Notredame, C., Holmes, L., Higgins, D.: COFFEE: an objective function for multiple sequence alignments. Bioinformatics 14(5), 407–422 (1998)
Orobitg, M., Guitaro, F., Cores, F., Llados, J., Notredame, C.: High performance computing improvements on bioinformatics consistency-based multiple sequence alignment tools (2014), http://dx.doi.org/10.1016/j.parco.2014.09.010
Reinert, K., Stoye, J., Will, T.: An iterative method for faster sum-of-pairs multiple sequence alignment. Bioinformatics 16, 808–814 (2000)
Riaz, T., Wang, Y., Li, K.: Multiple sequence alignment using tabu search. In: Proceeding of Asia-Pacific Bioinformatics Conference (APBC 2004), pp. 1–10 (2004)
Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4(4), 406–425 (1987)
Shyu, C., Sheneman, L., Foster, J.: Multiple sequence alignment with evolutionary computation. Genetic Programming and Evolvable Machines 5, 121–144 (2004)
Simossis, V., Heringa, J.: PRALINE: a multiple sequence alignment toolbox that integrates homology-extended and secondary structure information. Nucleic Acids Res. 33, 289–294 (2005)
Thompson, J., Higgins, D., Gibson, T.: ClustalW: improving the sensitivity of progressive multiple sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 22, 4673–4680 (1994)
Yokoyama, T., Watanabe, T., Taneda, A., Shimizu, T.: A web server for multiple sequence alignment using genetic algorithm. Genome Informatics, 12, 382–383 (2001)
Zhou, H., Zhou, Y.: SPEM: improving multiple sequence alignment with sequence profiles and predicted secondary structures. Bioinformatics 21, 3615–3621 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 IFIP International Federation for Information Processing
About this paper
Cite this paper
Mehenni, T. (2015). Multiple Guide Trees in a Tabu Search Algorithm for the Multiple Sequence Alignment Problem. In: Amine, A., Bellatreche, L., Elberrichi, Z., Neuhold, E., Wrembel, R. (eds) Computer Science and Its Applications. CIIA 2015. IFIP Advances in Information and Communication Technology, vol 456. Springer, Cham. https://doi.org/10.1007/978-3-319-19578-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-19578-0_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19577-3
Online ISBN: 978-3-319-19578-0
eBook Packages: Computer ScienceComputer Science (R0)