35 search results - page 2 / 7 » A Memetic Algorithm for Phylogenetic Reconstruction with Max... |
BMCBI
2007
13 years 4 months ago
2007
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
TCBB
2008
13 years 4 months ago
2008
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...
CIBCB
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— In this paper, we study the use of cooperation as a technique for designing faster algorithms for reconstructing phylogenetic trees. Our focus is on the use of cooperat...
CSB
2004
IEEE
13 years 8 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
TCBB
2008
13 years 4 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...