9 search results - page 2 / 2 » Word Length n-Grams for Text Re-use Detection |
CPM
1993
Springer
13 years 9 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--The problem of data stream classification is challenging because of many practical aspects associated with efficient processing and temporal behavior of the stream. Two s...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
ALGORITHMICA
2005
13 years 4 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...