514 search results - page 13 / 103 » Approximate Periods of Strings |
138
Voted
ALGORITHMICA
2005
15 years 3 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...
249
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
129
Voted
RSA
2002
15 years 3 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
133
Voted
COOPIS
2004
IEEE
15 years 7 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
99
Voted
CICLING
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...