Sciweavers

13 search results - page 3 / 3
» cpm 2000
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 9 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
13 years 9 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
13 years 9 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas