Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem

Adrien Goëffon 1, 2 Jean-Michel Richer 1, * Jin-Kao Hao 1
* Auteur correspondant
2 MAGNOME - Models and Algorithms for the Genome
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-complete problem, heuristic methods have been developed, often based on local search. In this article, we focus on the influence of the neighborhood relations. After analyzing the advantages and drawbacks of the well-known NNI, SPR and TBR neighborhoods, we introduce the concept of Progressive Neighborhood, which consists in constraining progressively the size of the neighborhood as the search advances. We empirically show that applied to the Maximum Parsimony problem, this progressive neighborhood turns out to be more efficient and robust than the classic neighborhoods using a descent algorithm. Indeed, it allows to find better solutions with a smaller number of iterations or trees evaluated.
Type de document :
Article dans une revue
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2008, 5 (1), pp.136--145. 〈10.1109/TCBB.2007.1065〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00350539
Contributeur : David James Sherman <>
Soumis le : mercredi 7 janvier 2009 - 10:35:13
Dernière modification le : mercredi 21 février 2018 - 15:48:03

Lien texte intégral

Identifiants

Collections

Citation

Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao. Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2008, 5 (1), pp.136--145. 〈10.1109/TCBB.2007.1065〉. 〈inria-00350539〉

Partager

Métriques

Consultations de la notice

246