Sciweavers

30 search results - page 4 / 6
» The Performance of Neighbor-Joining Methods of Phylogenetic ...
Sort
View
ICCS
2001
Springer
13 years 12 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
BIOINFORMATICS
2007
88views more  BIOINFORMATICS 2007»
13 years 7 months ago
Maximum likelihood of phylogenetic networks
Horizontal gene transfer (HGT) is believed to be ubiquitous among bacteria, and plays a major role in their genome diversiļ¬cation as well as their ability to develop resistance t...
Guohua Jin, Luay Nakhleh, Sagi Snir, Tamir Tuller
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
13 years 11 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
RECOMB
2004
Springer
14 years 7 months ago
Reconstructing reticulate evolution in species: theory and practice
We present new methods for reconstructing reticulate evolution of species due to events such as horizontal transfer or hybrid speciation; both methods are based upon extensions of...
Luay Nakhleh, Tandy Warnow, C. Randal Linder
TCBB
2008
122views more  TCBB 2008»
13 years 7 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
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...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...