34 search results - page 2 / 7 » RMESH Algorithms for Parallel String Matching |
CPM
1993
Springer
13 years 9 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
ALGORITHMICA
2005
13 years 5 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...
SIAMCOMP
1998
13 years 4 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
WEA
2004
Springer
13 years 10 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...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...