Sciweavers

Share
47 search results - page 1 / 10
» Bit-Parallel Witnesses and Their Applications to Approximate...
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
12 years 1 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
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...
Heikki Hyyrö, Gonzalo Navarro
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
12 years 7 months ago
Increased Bit-Parallelism for Approximate String Matching
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...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
SPIRE
2000
Springer
12 years 5 months ago
Bit-Parallel Approach to Approximate String Matching in Compressed Texts
Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, A...
LATA
2009
Springer
12 years 6 months ago
Nested Counters in Bit-Parallel String Matching
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...
Kimmo Fredriksson, Szymon Grabowski
AIRS
2004
Springer
12 years 7 months ago
On Bit-Parallel Processing of Multi-byte Text
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...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
books