Context-sensitive grammar transform: Compression and pattern matching

Shirou Maruyama, Yohei Tanaka, Hiroshi Sakamoto, Masayuki Takeda

研究成果: ジャーナルへの寄稿Conference article

10 引用 (Scopus)

抜粋

A framework of context-sensitive grammar transform is proposed. A greedy compression algorithm with the transform model is presented as well as a Knuth-Morris-Pratt (KMP)-type compressed pattern matching (CPM) algorithm. The compression performance is a match for gzip and Re-Pair. The search speed of our CPM algorithm is almost twice faster than the KMP type CPM algorithm on Byte-Pair-Encoding by Shibata et al. (2000), and in the case of short patterns, faster than the Boyer-Moore-Horspool algorithm with the stopper encoding by Rautio et al. (2002), which is regarded as one of the best combinations that allows a practically fast search.

元の言語英語
ページ(範囲)27-38
ページ数12
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5280 LNCS
DOI
出版物ステータス出版済み - 12 31 2008
イベント15th International Symposium on String Processing and Information Retrieval, SPIRE 2008 - Melbourne. VIC, オーストラリア
継続期間: 11 10 200811 12 2008

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用