| 作成者 |
|
|
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
This paper considers the Shift-And approach to the problem of pattern matching in LZW compressed text, and gives a new algorithm that solves it. The algorithm is indeed fast when the pattern length is... at most 32, or the word length. After an $ O(m+ mid Sigma mid) $ time and $ O(mid Sigma mid) $ space preprocessing of a pattern, it scans an LZW compressed text in $ O(n + r) $ time and reports all occurrences of the pattern, where $ n $ is the compressed text length, $ m $ is the pattern length, and r is the number of the pattern occurrences. Experimental results show that it runs approximately 1.5 times faster than a decompression followed by a simple search using the Shift-And algorithm. Moreover, the algorithm can be extended to the generalized pattern matching, to the pattern matching with $ k $ mismatches, and to the multiple pattern matching, like the Shift-And algorithm.続きを見る
|
Mendeley出力
trcs156.ps
trcs156