160 search results - page 1 / 32 » Improved Single and Multiple Approximate String Matching |
CPM
2004
Springer
13 years 11 months ago
2004
Springer
RSA
2002
13 years 5 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...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
WEA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
ASAP
2004
IEEE
13 years 9 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...