Arrêt de service programmé du vendredi 10 juin 16h jusqu’au lundi 13 juin 9h. Pour en savoir plus
Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony

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.

Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.univ-angers.fr/hal-03255576
Contributeur : Okina Univ Angers Connectez-vous pour contacter le contributeur
Soumis le : mercredi 9 juin 2021 - 16:08:32
Dernière modification le : mercredi 20 octobre 2021 - 03:19:09

Lien texte intégral

Identifiants

Collections

Citation

Jean-Michel Richer, Adrien Goëffon, Jin-Kao Hao. A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony. 7th European Conference, EvoBIO 2009, 2009, Tübingen, Germany. pp.164 - 175, ⟨10.1007/978-3-642-01184-9_15⟩. ⟨hal-03255576⟩

Partager

Métriques

Consultations de la notice

16