431 search results - page 52 / 87 » Drawing Phylogenetic Trees |
194
click to vote
AB
2008
Springer
15 years 4 months ago
2008
Springer
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
120
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
107
click to vote
TCBB
2008
15 years 1 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...
122
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
123
click to vote
UAI
2008
15 years 3 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...