53 search results - page 1 / 11 » A Fast Bit-Vector Algorithm for Approximate String Matching ... |
CPM
1998
Springer
13 years 8 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
SOFSEM
2005
Springer
13 years 9 months ago
2005
Springer
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...
LATIN
1998
Springer
13 years 8 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
JSA
2008
13 years 4 months 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...