Sciweavers

275 search results - page 9 / 55
» join 2007
Sort
View
JCB
2007
92views more  JCB 2007»
13 years 9 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran
AB
2008
Springer
13 years 11 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
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...
Kord Eickmeyer, Ruriko Yoshida
DASFAA
2007
IEEE
174views Database» more  DASFAA 2007»
14 years 4 months ago
Efficient Holistic Twig Joins in Leaf-to-Root Combining with Root-to-Leaf Way
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, Tw...
Guoliang Li, Jianhua Feng, Yong Zhang, Lizhu Zhou
VLDB
2007
ACM
229views Database» more  VLDB 2007»
14 years 3 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
14 years 3 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo