8 search results - page 1 / 2 » Improved Approximate String Matching and Regular Expression ... |
CPM
2007
Springer
15 years 18 hour ago
2007
Springer
CPM
2000
Springer
14 years 10 months ago
2000
Springer
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...
CPM
2000
Springer
14 years 10 months ago
2000
Springer
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...
ISAAC
2003
Springer
14 years 11 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
SIGIR
1998
ACM
14 years 10 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....