<テクニカルレポート>
More Speed and More Compression: Accelerating Pattern Matching by Text Compression

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 This paper addresses the problem of speeding up string matching by text compression, and presents a compressed pattern matching (CPM) algorithm which finds a pattern within a text given as a collage s...ystem <D,S> that variable sequence S is encoded by byte-oriented Huffman coding. The compression ratio is high compared with existing CPM algorithms addressing the problem, and the search time reduction ratio compared to the Knuth-Morris-Pratt algorithm over uncompressed text is nearly the same as the compression ratio.続きを見る

本文情報を非表示

trcs232 pdf 287 KB 28  

詳細

レコードID
査読有無
関連情報
主題
タイプ
登録日 2009.04.22
更新日 2017.09.05