Sciweavers

Share
76 search results - page 1 / 16
» Local Search for the Maximum Parsimony Problem
Sort
View
ICNC
2005
Springer
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 ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
TCBB
2008
107views more  TCBB 2008»
8 years 9 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
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-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
EVOW
2009
Springer
9 years 4 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...
IJCBDD
2008
113views more  IJCBDD 2008»
8 years 9 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
BMCBI
2007
165views more  BMCBI 2007»
8 years 9 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
books