101 search results - page 10 / 21 » On String Matching in Chunked Texts |
ALGORITHMICA
2005
13 years 7 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
14 years 25 days 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...
JDA
2007
13 years 7 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
AIRS
2004
Springer
14 years 27 days 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...