178
Voted
ICDE
2012
IEEE
13 years 2 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 ...
118
click to vote
ALGORITHMICA
2005
15 years 12 days 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...
104
Voted
JSA
2008
15 years 13 days ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
181
Voted
VLDB
2008
ACM
16 years 21 days ago
2008
ACM