Sciweavers

20 search results - page 1 / 4
» Inference of Molecular Phylogenetic Tree Based on Minimum Mo...
Sort
View
74
Voted
ISMB
1997
14 years 10 months ago
Inference of Molecular Phylogenetic Tree Based on Minimum Model-Based Complexity Method
Hiroshi Tanaka, Fengrong Ren, Toshitsugu Okayama, ...
EOR
2006
110views more  EOR 2006»
14 years 9 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta
WABI
2010
Springer
168views Bioinformatics» more  WABI 2010»
14 years 7 months ago
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
Jesper Jansson, Richard S. Lemence, Andrzej Lingas
BMCBI
2008
104views more  BMCBI 2008»
14 years 9 months ago
Comparison of methods for estimating the nucleotide substitution matrix
Background: The nucleotide substitution rate matrix is a key parameter of molecular evolution. Several methods for inferring this parameter have been proposed, with different math...
Maribeth Oscamou, Daniel McDonald, Von Bing Yap, G...
IPPS
2007
IEEE
15 years 3 months ago
RAxML-Cell: Parallel Phylogenetic Tree Inference on the Cell Broadband Engine
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
Filip Blagojevic, Alexandros Stamatakis, Christos ...