Sciweavers

CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 3 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
92views Combinatorics» more  CPM 2000»
14 years 3 months ago
Finding Maximal Quasiperiodicities in Strings
Gerth Stølting Brodal, Christian N. S. Pede...
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 3 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...