47 search results - page 1 / 10 » Bit-Parallel Witnesses and Their Applications to Approximate... |
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...
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...
SPIRE
2000
Springer
13 years 8 months ago
2000
Springer
LATA
2009
Springer
13 years 9 months ago
2009
Springer
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
AIRS
2004
Springer
13 years 10 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...