Sciweavers

Share
ICNC
2005
Springer

Local Search for the Maximum Parsimony Problem

9 years 2 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood is introduced and studied in combination with an effective array-based tree representation. Computational results are shown on a set of randomly generated benchmark instances as well as on 8 real problems (sequences of phytopathogen γ-proteobacteria) and compared with two references from the literature.
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICNC
Authors Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao
Comments (0)
books