Abstract
A phylogeny is a tree that relates taxonomic units, based on their similarity over a set of characters. The problem of finding a phylogeny with the minimum number of evolutionary steps (the so-called parsimony criterion) is one of the main problems in comparative biology. In this work, we study different heuristic approaches to the phylogeny problem under the parsimony criterion. New algorithms based on metaheuristics are also proposed. All heuristics are implemented and compared under the same framework, leading to consistent and thorough comparative results. Computational results are reported for benchmark instances from the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andreatta, A.A. (1998). “A Framework for the Development of Local Search Heuristics with an Application to the Phylogeny Problem.” Ph.D. Dissertation, Computer Science Department, Catholic University of Rio de Janeiro, Rio de Janeiro (in Portuguese).
Andreatta, A.A., S.E.R. Carvalho, and C.C. Ribeiro. (2002). “A Framework for Local Search Heuristics for Combinatorial Optimization Problems.” S. Voss and D. Woodruff (Eds.), In Optimization Software Class Libraries, Kluwer, pp. 60–80.
Ayala, F.J. (1995). “The Myth of Eve: Molecular Biology and Human Origins.” Science 270, 1930–1939.
Bodlaender, H., M. Fellows, and T. Warnow. (1992). “Two Strikes Against the Perfect Phylogeny Problem.” In Proceedings of the International Conference on Algorithms, Languages and Programming, Wien: Springer-Verlag, pp. 273–283.
Buschmann, F., R. Meunier, H. Rohnert, and P. Sommerlad. (1996). Pattern-Oriented Software Development. New York: Wiley.
Day, W.H.E., D.S. Johnson, and D. Sankoff. (1986). “The Computational Complexity of Inferring Rooted Phylogenies by Parsimony.” Mathematical Biosciences 81, 33–42.
Dress, A. and M. Krüger. (1987). “Parsimonious Phylogenetic Trees in Metric Spaces and Simulated Annealing.” Advances in Applied Mathematics 8, 8–37.
Farris, J.S. (1970). “Methods for Computing Wagner Trees.” Systematic Zoology 19, 83–92.
Fayad, M. and D. Schmidt. (1997). “Object-Oriented Application Frameworks.” Communications of the ACM 40, 32–38.
Feo, T.A. and M.G.C. Resende. (1995). “Greedy Randomized Adaptative Search Procedures.” Journal of Global Optimization 6, 109–133.
Fitch, W.M. (1971). “Towards Defining the Course of Evolution: Minimum Chances for a Specific Tree Topology.” Systematic Zoology 20, 406–419.
Fitch, W.M. and J.S. Farris. (1974). “Evolutionary Trees with Minimum Nucleotide Replacements from Amino Acid Sequences.” Journal of Molecular Evolution 3, 263–278.
Foulds, L.R. and R.L. Graham. (1982). “The Steiner Problem in Phylogeny is NP-Complete.” Advances in Applied Mathematics 3, 43–49.
Foulds, L.R. and R.L. Graham. (1982). “Unlikelihood that Minimal Phylogenics for a Realistic Biological Study can be Constructed in Reasonable Computational Time.” Mathematical Biosciences 60, 133–142.
Gamma, E., R. Helm, R. Johnson, and J. Vlissides. (1994). Design Patterns–Elements of Reusable Object Oriented Software. Reading, MA: Addison Wesley.
Goloboff, P.A. (1996). “Methods for Faster Parsimony Analysis.” Cladistics 9, 199–220.
Goloboff, P.A. Personnal communication, 1997.
Hennig, W. (1966). Phylogenetic Systematics. Urbana: University of Illinois Press.
Johnson, R.E. (1997). “Components, Frameworks, Patterns.” Available at ftp://st.cs.uiuc.edu/∼papers/frameworks/framework97.ps.
Luckow, M. and R.A. Pimentel. (1985). “An Empirical Comparison of Numerical Wagner Computer Programs.” Cladistics 1, 47–66.
Mladenović, N. and P. Hansen. (1997). “Variable Neighbourhood Search.” Computers and Operations Research 24, 1097–1100.
Penny, D., L.R. Foulds, and M.D. Hendy. (1982). “Testing the Theory of Evolution by Comparing Phylogenetic Trees Constructed from Five Different Protein Sequences.” Nature 247, 197–200.
Platnick, N.I. (1987). “An Empirical Comparison of Microcomputer Parsimony Programs.” Cladistics 3, 121–144.
Platnick, N.I. (1989). “An Empirical Comparison of Microcomputer Parsimony Programs II.” Cladistics 5, 145–161.
Rumbaugh, J. (1995). “OMT: The Object Model.” Journal of Object Oriented Programming 7, 21–27.
Rumbaugh, J., M. Blaha, W. Premerlani, F. Eddy, and W. Lorensen. (1991). Object Oriented Modeling and Design. Englewood Cliffs, NJ: Prentice-Hall.
Sankoff, D.D. and P. Rousseau. (1975). “Locating the Vertices of a Steiner Tree in Arbitrary Space.” Mathematical Programming 5, 240–249.
Sober, E. (1987). “Parsimony, Likelihood and the Principle of the Common Cause.” Philosophy of Science 54, 465–469.
Swofford, D.L. and G. Olsen. (1990). “Phylogeny Reconstruction.” In D.M. Hillis and C. Moritz (Eds.), Molecular Systematics, Sunderland: Sinauer.
Wiley, E.O., D. Siegel-Causey, D.R. Brooks, and V.A. Funk. (1991). The Compleat Cladist: A Primer of Phylogenetic Procedures. Special publication no. 19, University of Kansas, Museum of Natural History.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Andreatta, A.A., Ribeiro, C.C. Heuristics for the Phylogeny Problem. Journal of Heuristics 8, 429–447 (2002). https://doi.org/10.1023/A:1015439913121
Issue Date:
DOI: https://doi.org/10.1023/A:1015439913121