160 search results - page 1 / 32 » Improved Single and Multiple Approximate String Matching |
57
Voted
CPM
2004
Springer
15 years 2 months ago
2004
Springer
RSA
2002
14 years 9 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...
136
Voted
ICDE
2012
IEEE
12 years 12 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 ...
112
click to vote
WEA
2004
Springer
15 years 2 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...
103
click to vote
ASAP
2004
IEEE
15 years 1 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...