Abstract
One of the most important aspect of molecular and computational biology is the reconstruction of evolutionary relationships. The area is well explored after decades of intensive research. Despite this fact there remains a need for good and efficient algorithms that are capable of reconstructing the evolutionary relationship in reasonable time.
Since the problem is computationally intractable, exact algorithms are used only for small groups of species. In the Maximum Parsimony approach the time of computation grows so fast when number of sequences increases, that in practice it is possible to find the optimal solution for instances containing about 20 sequences only.
It is this reason that in practical applications, heuristic methods are used. In this paper, parallel adaptive memory programming algorithms based on Maximum Parsimony and some known neighborhood search methods for phylogenetic tree construction are proposed, and the results of computational experiments are presented. The proposed algorithms achieve a superlinear speedup and find solutions of good quality.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Andreatta, A. A., & Ribeiro, C. C. (2005). Heuristics for the phylogeny problem. Journal of Heuristics, 86, 429–447.
Barker, D. (2004). LVB: Parsimony and simulated annealing in the search for phylogenetic trees. Bioinformatics, 20, 274–275.
Blazewicz, J., Formanowicz, P., Kedziora, P., & Wojciechowski, P. (2004). Parallel algorithms for evolutionary history reconstruction. In Lecture notes in computer science : Vol. 3019 (pp. 1138–1145). Berlin: Springer.
Day, W. H. E., Jonhson, D. S., & Sankoff, D. (1986). The computational complexity of inferring rooted phylogenies by parsimony. Mathematical Biosciences, 81, 33–42.
Eck, R. V., & Dayhoff, M. O. (1966). Atlas of protein sequence and structure. In National biomedical research foundation. Maryland: Silver Springs.
Edwards, A. W. F., & Cavalli-Sforza, L. L. (1963). The reconstruction of evolution. Annals of Human Genetics, 27, 105–106.
Edwards, A. W. F., & Cavalli-Sforza, L. L. (1964). Reconstruction of evolutionary trees. In V. H. Heywood & J. McNeill (Eds.), Phonetic and phylogenetic classification, systematics association publish: Vol. 6 (pp. 67–76) London.
Fayad, M., & Schmidt, D. (1997). Object-oriented application frameworks. Communications of the ACM, 40, 32–38.
Felsenstein, J. (1989). PHYLIP—Phylogeny Inference Package (Version 3.2), Cladistics, 5.
Felsenstein, J. (2004). Inferring phylogenies. Sunderland: Sinauer Associates.
Felsenstein, J. (2005). PHYLIP (Phylogeny Inference Package) version 3.6. Distributed by the author, Department of Genome Sciences, University of Washington, Seattle.
Fitch, W. M. (1971). Toward defining the course of evolution: minimum change for a specified tree topology. Systematic Zoology, 20, 406–416.
Foulds, L. R., & Graham, R. L. (1982). The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics, 3, 43–49.
Goëffon, A., Richer, J. M., & Hao, J. K. (2005). Local search for the maximum parsimony problem. In Lecture notes in computer science : Vol. 3612. ICNC ’05—first international conference on natural computation (pp. 678–683). Berlin: Springer.
Goëffon, A., Richer, J. M., & Hao, J. K. (2008). Progressive tree neighborhood applied to the maximum parsimony problem. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(1).
Glover, F. (1989). Tabu search, Part I. ORSA Journal on Computing, 1, 190–206.
Glover, F. (1997). Tabu search and adaptive memory programming—advances, applications and challenges. In Barr, Helgason, & Kenington (Eds.) Advances in metaheuristics, optimization and stochastic modeling technologies (pp. 1–75). Boston: Kluwer Academic.
Goloboff, P. (1999). Analyzing large data sets in reasonable times: solution for composite optima. Cladistics, 15, 415–428.
Gusfield, D. (1997). Algorithms on strings, trees, and sequences. Cambridge: Cambridge University Press.
Hendy, M. D., & Penny, D. (1982). Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences, 59, 277–290.
Kedziora, P., Blazewicz, J., Formanowicz, P., Figlerowicz, M., Alejska, M., Jackowiak, P., Malinowska, N., & Fratczak, A. (2005). Computational methods in diagnostics of chronic hepatitis C. Bulletin of the Polish Academy of Sciences. Technical Sciences, 53, 273–281.
Lin, Y., Fang, S., & Thorne, J. (2007). A tabu search algorithm for maximum parsimony phylogeny. European Journal of Operational Research, 176, 1908–1917.
Luckow, M., & Pimentel, R. A. (1985). Numerical Wagner computer programs. Cladistics, 1, 47–66.
Mladenović, N., & Hansen, P. (1997). Variable neighbourhood search. Computers and Operations Research, 24, 1097–1100.
Nei, M., & Kumar, S. (2000). Molecular evolution and phylogenetics. New York: Oxford University Press.
Nelesen, S., Liu, K., Zhao, D., Linder, C. R., & Warnow, T. (2008). The effect of the guide tree on multiple sequence alignments and subsequent phylogenetic analyses. Pacific Symposium on Biocomputing, 13, 25–36.
Nixon, K. C. (1999). The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics, 15, 407–414.
R Development Core Team (2008) A Language and Environment for Statistical Computing. http://www.R-project.org, R Foundation for Statistical Computing, ISBN 3-900051-07-0.
Roshan, U., Moret, B. M. E., Williams, T. L., & Warnow, T. (2004). Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees. In Proceedings of the IEEE computational systems bioinformatics conference, 2004.
Ribeiro, C. C., & Vianna, D. S. (2005). A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. International Transactions in Operational Research, 12, 325–338.
Stoye, J., Evers, D., & Meyer, F. (1998). Rose: generating sequence families. Bioinformatics, 14(2), 157–163.
Setubal, J., & Meidanis, J. (1997). Introduction to computational molecular biology. Boston: PWS Publishing Company.
Stamatakis, A. (2004). Distributed and parallel algorithms and systems for inference of huge phylogenetic trees based on the maximum likelihood method. Ph.D. thesis, Technische Universität München, Germany.
Taillard, E. D., Gambardella, L. M., Gendreau, M., & Potvin, J. (2001). Adaptive memory programming: a unified view of metaheuristics. European Journal of Operational Research, 135, 1–16.
Tamura, K., Dudley, J., Nei, M., & Kumar, S. (2007). MEGA4: molecular evolutionary genetics analysis (MEGA) software version 4.0. Molecular Biology and Evolution, 24, 1596–1599.
Viana, G. V. R., Gomes, F. A. C., Meneses, C. N., & Ferreira, C. E. (2009). Parallelization of a multi-neighborhood local search heuristic for a phylogeny problem. International Journal of Bioinformatics Research and Applications (IJBRA), 5, 163–177.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Blazewicz, J., Formanowicz, P., Kedziora, P. et al. Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction. Ann Oper Res 183, 75–94 (2011). https://doi.org/10.1007/s10479-010-0682-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0682-5