SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
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...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
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...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
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...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
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...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
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...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
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...
SODA
2001
ACM
13 years 5 months ago
2001
ACM