Pattern matching in Huffman encoded texts

被引：0
|
作者：
Klein, ST [1 ]
Shapira, D
机构：
[1] Bar Ilan Univ, Dept Math & CS, IL-52900 Ramat Gan, Israel
[2] Brandeis Univ, Dept Comp Sci, Waltham, MA 02254 USA
来源：
INFORMATION PROCESSING & MANAGEMENT | 2005年 / 41卷 / 04期
关键词：
data compression; Huffman codes; pattern matching; compressed matching;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of erroneously declared matches. The probability of such false matches is analyzed and empirically tested. (c) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码：829 / 841
页数：13
相关论文
共 50 条
  • [1] Pattern matching in Huffman encoded texts
    Klein, ST
    Shapira, D
    DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2001, : 449 - 458
  • [2] Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
    Daptardar, A
    Shapira, D
    DCC 2004: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2004, : 535 - 535
  • [3] Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
    Shapira, D
    Daptardar, A
    INFORMATION PROCESSING & MANAGEMENT, 2006, 42 (02) : 429 - 439
  • [4] Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts
    Shmuel T. Klein
    Information Retrieval, 2000, 3 : 7 - 23
  • [5] Skeleton trees for the efficient decoding of Huffman encoded texts
    Klein, ST
    INFORMATION RETRIEVAL, 2000, 3 (01): : 7 - 23
  • [6] Efficient string matching in Huffman compressed texts
    Fredriksson, K
    Tarhio, J
    FUNDAMENTA INFORMATICAE, 2004, 63 (01) : 1 - 16
  • [7] Pattern matching in dynamic texts
    Alstrup, S
    Brodal, GS
    Rauhe, T
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 819 - 828
  • [8] Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts
    Cantone, Domenico
    Faro, Simone
    Giaquinta, Emanuele
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 29 - 39
  • [9] ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS
    Cantone, Domenico
    Faro, Simone
    Giaquinta, Emanuele
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (02) : 343 - 356
  • [10] Verifiable pattern matching on outsourced texts
    Catalano, Dario
    Di Raimondo, Mario
    Faro, Simone
    JOURNAL OF DISCRETE ALGORITHMS, 2018, 51 : 39 - 50
12345