Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

ICNC
2005
Springer

favoriteEmaildiscussreport

169views Applied Computing» more ICNC 2005»

Local Search for the Maximum Parsimony Problem

14 years 26 days ago

Local Search for the Maximum Parsimony Problem

Download www.info.univ-angers.fr

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 eﬀective 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

Real-time Traffic

ICNC 2005 | Maximum Parsimony Criterion | Phylogenetic Tree Reconstruction | Subtree Swapping Neighborhood |

claim paper

Related Content

» Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem

» A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony

» Parsimony accelerated Maximum Likelihood searches

» Direct maximum parsimony phylogeny reconstruction from genotype data

» Solving the maximum clique problem by kopt local search

» Flexible Stochastic Local Search for Haplotype Inference

» Iterated kOpt Local Search for the Maximum Clique Problem

» Dynamic Local Search for the Maximum Clique Problem

» Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony

Post Info
More Details (n/a)

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)