47 search results - page 2 / 10 » Bit-Parallel Witnesses and Their Applications to Approximate... |
SPIRE
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
84
Voted
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
ISAAC
2001
Springer
15 years 1 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
PDPTA
2003
14 years 10 months ago
2003
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...