134 search results - page 3 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
CPM
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
CIAC
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
DLT
2004
13 years 11 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
CPM
1999
Springer
14 years 2 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
COMPSAC
2002
IEEE
14 years 3 months ago
2002
IEEE
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...