Sciweavers

7 search results - page 1 / 2
» A fast program for maximum likelihood-based inference of lar...
Sort
View
SAC
2004
ACM
14 years 14 days ago
A fast program for maximum likelihood-based inference of large phylogenetic trees
Alexandros Stamatakis, Thomas Ludwig 0002, Harald ...
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...
IPPS
2003
IEEE
14 years 10 days ago
Phylogenetic Tree Inference on PC Architectures with AxML/PAxML
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
Alexandros Stamatakis, Thomas Ludwig 0002
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 months ago
Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
Sophie S. Abby, Eric Tannier, Manolo Gouy, Vincent...
BMCBI
2006
143views more  BMCBI 2006»
13 years 7 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...