Sciweavers

Share
78 search results - page 2 / 16
» Reconstructing Phylogenetic Networks Using Maximum Parsimony
Sort
View
EVOW
2009
Springer
9 years 6 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...
ICNC
2005
Springer
9 years 5 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...
CIBCB
2005
IEEE
9 years 5 months ago
Cooperative Rec-I-DCM3: A Population-Based Approach for Reconstructing Phylogenies
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...
Tiffani Williams, Marc Smith
APBC
2004
132views Bioinformatics» more  APBC 2004»
9 years 1 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
9 years 3 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
books