Sciweavers

101 search results - page 2 / 21
» On String Matching in Chunked Texts
Sort
View
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
13 years 9 months ago
Detecting False Matches in String Matching Algorithms
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 ...
S. Muthukrishnan
DRR
2004
13 years 7 months ago
A nonparametric classifier for unsegmented text
Symbolic Indirect Correlation (SIC) is a new classification method for unsegmented patterns. SIC requires two levels of comparisons. First, the feature sequences from an unknown q...
George Nagy, Ashutosh Joshi, Mukkai S. Krishnamoor...
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
13 years 9 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
13 years 9 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...
SPIRE
2000
Springer
13 years 8 months ago
Bit-Parallel Approach to Approximate String Matching in Compressed Texts
Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, A...