Sciweavers

Share
35 search results - page 1 / 7
» A Memetic Algorithm for Phylogenetic Reconstruction with Max...
Sort
View
EVOW
2009
Springer
9 years 5 months ago
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony
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 ...
Jean-Michel Richer, Adrien Goëffon, Jin-Kao H...
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
9 years 1 months ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith
ICNC
2005
Springer
9 years 3 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 ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
TCBB
2010
166views more  TCBB 2010»
8 years 8 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
CSB
2005
IEEE
141views Bioinformatics» more  CSB 2005»
9 years 3 months ago
Reconstructing Phylogenetic Networks Using Maximum Parsimony
Phylogenies—the evolutionary histories of groups of organisms—are one of the most widely used tools throughout the life sciences, as well as objects of research within systema...
Luay Nakhleh, Guohua Jin, Fengmei Zhao, John M. Me...
books