Sciweavers

Share
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
9 years 7 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
9 years 7 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
SODA
2001
ACM
70views Algorithms» more  SODA 2001»
9 years 7 months ago
Web caching using access statistics
Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
SODA
2001
ACM
144views Algorithms» more  SODA 2001»
9 years 7 months ago
Representing dynamic binary trees succinctly
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
J. Ian Munro, Venkatesh Raman, Adam J. Storm
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
9 years 7 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt
SODA
2001
ACM
99views Algorithms» more  SODA 2001»
9 years 7 months ago
Fast implementation of depth contours using topological sweep
Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Jo...
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
9 years 7 months ago
The diameter of random massive graphs
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
9 years 7 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
books