### Abstract

In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Corasick pattern matching machine. The new algorithm finds all occurrences of multiple patterns whereas the algorithm proposed by Amir, Benson, and Farach finds only the first occurrence of a single pattern. The new algorithm runs in O(n + m^{2} + r) time using O(n + m^{2}) space, where n is the length of the compressed text, m is the length of the total length of the patterns, and r is the number of occurrences of the patterns. We implemented a simple version of the algorithm, and showed that it is approximately twice faster than a decompression followed by a search using the Aho-Corasick machine.

Original language | English |
---|---|

Pages (from-to) | 103-112 |

Number of pages | 10 |

Journal | Unknown Journal |

Publication status | Published - 1998 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Hardware and Architecture
- Electrical and Electronic Engineering

### Cite this

*Unknown Journal*, 103-112.

**Multiple pattern matching in LZW compressed text.** / Kida, Takuya; Takeda, Masayuki; Shinohara, Ayumi; Miyazaki, Masamichi; Arikawa, Setsuo.

Research output: Contribution to journal › Article

*Unknown Journal*, pp. 103-112.

}

TY - JOUR

T1 - Multiple pattern matching in LZW compressed text

AU - Kida, Takuya

AU - Takeda, Masayuki

AU - Shinohara, Ayumi

AU - Miyazaki, Masamichi

AU - Arikawa, Setsuo

PY - 1998

Y1 - 1998

N2 - In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Corasick pattern matching machine. The new algorithm finds all occurrences of multiple patterns whereas the algorithm proposed by Amir, Benson, and Farach finds only the first occurrence of a single pattern. The new algorithm runs in O(n + m2 + r) time using O(n + m2) space, where n is the length of the compressed text, m is the length of the total length of the patterns, and r is the number of occurrences of the patterns. We implemented a simple version of the algorithm, and showed that it is approximately twice faster than a decompression followed by a search using the Aho-Corasick machine.

AB - In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Corasick pattern matching machine. The new algorithm finds all occurrences of multiple patterns whereas the algorithm proposed by Amir, Benson, and Farach finds only the first occurrence of a single pattern. The new algorithm runs in O(n + m2 + r) time using O(n + m2) space, where n is the length of the compressed text, m is the length of the total length of the patterns, and r is the number of occurrences of the patterns. We implemented a simple version of the algorithm, and showed that it is approximately twice faster than a decompression followed by a search using the Aho-Corasick machine.

UR - http://www.scopus.com/inward/record.url?scp=0031679356&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031679356&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031679356

SP - 103

EP - 112

JO - Quaternary International

JF - Quaternary International

SN - 1040-6182

ER -