A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony

  • Jean-Michel Richer
  • Adrien Goëffon
  • Jin-Kao Hao
Conference paper

DOI: 10.1007/978-3-642-01184-9_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5483)
Cite this paper as:
Richer JM., Goëffon A., Hao JK. (2009) A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony. In: Pizzuti C., Ritchie M.D., Giacobini M. (eds) Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics. EvoBIO 2009. Lecture Notes in Computer Science, vol 5483. Springer, Berlin, Heidelberg

Abstract

The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been devoted by the research community to solve this NP-complete problem and many algorithms and techniques have been devised in order to find high quality solutions with reasonable computational resources. In this paper we present a memetic algorithm (implemented in the software Hydra) which is based on an integration of an effective local search operator with a specific topological tree crossover operator. We report computational results of Hydra on a set of 12 benchmark instances from the literature and demonstrate its effectiveness with respect to one of the most powerful software (TNT). We also study the behavior of the algorithm with respect to some fundamental ingredients.

Keywords

Maximum Parsimony phylogeny progressive descent tree crossover memetic algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jean-Michel Richer
    • 1
  • Adrien Goëffon
    • 2
  • Jin-Kao Hao
    • 1
  1. 1.University of Angers, LERIAAnger Cedex 01France
  2. 2.LaBRI (UMR 5800) Université de BordeauxTalence CedexFrance

Personalised recommendations