Sciweavers

381 search results - page 4 / 77
» Fast Neighbor Joining
Sort
View
DASFAA
2010
IEEE
158views Database» more  DASFAA 2010»
15 years 3 months ago
DigestJoin: Expediting Joins on Solid-State Drives
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...
Shen Gao, Yu Li, Jianliang Xu, Byron Choi, Haibo H...
NBIS
2007
Springer
15 years 4 months ago
A Ring Infrastructure for Neighbor-Centric Peer-to-Peer Applications
We propose a peer-to-peer system that supports distributed virtual world applications. For these applications, the connections between directly neighboring peers are of the utmost ...
Oliver Haase, Alfred Toth, Jürgen Wäsch
BMCBI
2007
138views more  BMCBI 2007»
14 years 10 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 10 months ago
Why neighbor-joining works
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
Radu Mihaescu, Dan Levy, Lior Pachter
JCB
2002
108views more  JCB 2002»
14 years 9 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel