Sciweavers

30 search results - page 5 / 6
» A 3-approximation algorithm for the subtree distance between...
Sort
View
BMCBI
2008
111views more  BMCBI 2008»
13 years 8 months ago
A perl package and an alignment tool for phylogenetic networks
Background: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of evolutionary events acting at the population level, like recombin...
Gabriel Cardona, Francesc Rosselló, Gabriel...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 8 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
13 years 10 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
JCSS
2002
199views more  JCSS 2002»
13 years 8 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
PAMI
2006
134views more  PAMI 2006»
13 years 8 months ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee