@inproceedings{c1df3e7f7bcc456783081d3e8999ff93,
title = "Multiple pattern matching algorithms on collage system",
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 decompression. Various algorithms have been proposed depending on underlying compression methods in the last decade. Although some algorithms for multi pattern searching on compressed text were also presented very recently, all of them are only for Lempel-Ziv family compressions. In this paper we propose two types of multi pattern matching algorithms on collage system, which simulate the AC algorithm and a multi pattern version of the BM algorithm, the most important algorithms for searching in uncompressed files. Collage system is a formal framework which is suitable to capture the essence of compressed pattern matching according to various dictionary based compressions. That is, we provide the model of multi pattern matching algorithm for any compression method covered by the framework.",
author = "Takuya Kida and Tetsuya Matsumoto and Masayuki Takeda and Ayumi Shinohara and Setsuo Arikawa",
year = "2001",
doi = "10.1007/3-540-48194-x_18",
language = "English",
isbn = "3540422714",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "193--206",
editor = "Amihood Amir and Amihood Amir and Landau, {Gad M.} and Landau, {Gad M.}",
booktitle = "Combinatorial Pattern Matching - 12th Annual Symposium, CPM 2001, Proceedings",
address = "Germany",
note = "12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001 ; Conference date: 01-07-2001 Through 04-07-2001",
}