Year: 2007
Type: report
Abstract: . 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 system 〈D, S 〉 such 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. 1
Authors: Matsumoto, Tetsuya, 松本, 徹也, マツモト, テツヤ, 萩尾, 一仁, ハギオ, カズヒト, 竹田, 正幸, タケダ, マサユキ
Institution: Kyushu University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2529556573
