Skip to main content
SpringerLink
Log in

A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem

  • Conference paper
Parallel Problem Solving from Nature - PPSN IX (PPSN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4193))

Included in the following conference series:

Abstract

The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of evolutionary changes. Known to be NP-complete, the MP problem has many applications. This paper introduces a Distance-based Information Preservation (DiBIP) Tree Crossover. Contrary to previous crossover operators, DiBIP uses a distance measure to characterize the semantic information of a phylogenetic tree and ensures the preservation of distance related properties between parents and offspring. The performance of DiBIP is assessed with a mimetic algorithm on a set of 28 benchmark instances from the literature. Comparisons with 3 state-of-the-art algorithms show very competitive results of the proposed approach with improvement of some previously best results found.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  2. Congdon, C.B.: Gaphyl: An Evolutionary Algorithms Approach For The Study Of Natural Evolution. In: Proceedings of the 6th Joint Conference on Information Science (2002)

    Google Scholar 

  3. Congdon, C.B., Septor, K.J.: Phylogenetic trees using evolutionary search: Initial progress in extending gaphyl to work with genetic data. In: Proc. of the 2003 Congress on Evolutionary Computation, pp. 320–326. IEEE press, Los Alamitos (2003)

    Google Scholar 

  4. Cotta, C., Moscato, P.: Inferring Phylogenetic Trees Using Evolutionary Algorithms. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 720–729. Springer, Heidelberg (2002)

    Google Scholar 

  5. Felsenstein, J.: Inferring phylogenies. Sinauer Associates (2003)

    Google Scholar 

  6. Fitch, W.: Towards defining course of evolution: minimum change for a specified tree topology. Systematic Zoology 20, 406–416 (1971)

    Article  Google Scholar 

  7. Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics 3, 43–49 (1982)

    Article  MathSciNet  Google Scholar 

  8. Goëffon, A., Richer, J.-M., Hao, J.-K.: Local search for the maximum parsimony problem. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol. 3612, pp. 678–683. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Goëffon, A., Richer, J.-M., Hao, J.-K.: Progressive Tree Neighborhood applied to the Maximum Parsimony Problem. IEEE Transactions on Computational Biology and Bioinformatics (submitted, 2006)

    Google Scholar 

  10. Goloboff, P.A., Farris, J.S., Nixon, K.: TNT: Tree Analysis Using New Technology (2003)

    Google Scholar 

  11. Hillis, D., Moritz, C., Mable, B.: Molecular Systematics. Sinauer, Boston (1996)

    Google Scholar 

  12. Lewis, P.O.: A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data. Molecular Biolology and Evolution 15(3), 277–283 (1998)

    Article  Google Scholar 

  13. Matsuda, H.: Protein Phylogenetic Inference Using Maximum Likelihood With A Genetic Algorithm. In: Prof. of Pacific Symposium on Biocomputing, pp. 512–536 (1996)

    Google Scholar 

  14. Moilanen, A.: Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization. Cladistics 15(1), 39–50 (1998)

    Article  Google Scholar 

  15. Ribeiro, C.C., Vianna, D.S.: A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. In: Proc. of 2nd Bresil Workshop on Bioinformatics, pp. 97–102 (2003)

    Google Scholar 

  16. Ribeiro, C.C., Vianna, D.S.: A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. International Transactions in Operational Research 12, 1–14 (2005)

    Article  MathSciNet  Google Scholar 

  17. Sneath, P.H.A., Sokal, R.R.: Numerical taxonomy. W.H. Freeman and Co., San Francisco, California (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, University of Angers, 2 bd Lavoisier, 49 045 Cedex 01, Angers, France

    Adrien Goëffon, Jean-Michel Richer & Jin-Kao Hao

Authors
  1. Adrien Goëffon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Michel Richer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jin-Kao Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Science Institute, University of Iceland, P.O. Box, Iceland

    Thomas Philip Runarsson

  2. Vorarlberg University of Applied Sciences, Hochschulstr. 1, A-6850, Dornbirn, Austria

    Hans-Georg Beyer

  3. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund Burke

  4. Depto. Arquitectura y Tecnologa de Computadores, ETS Ingeiera Informtica, C/Daniel Saucedo Aranda, s/n, 18071, Granada, Spain

    Juan J. Merelo-Guervós

  5. Colorado State University, 80523, Fort Collins, CO, USA

    L. Darrell Whitley

  6. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goëffon, A., Richer, JM., Hao, JK. (2006). A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_77

Download citation

  • DOI: https://doi.org/10.1007/11844297_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38990-3

  • Online ISBN: 978-3-540-38991-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation