返回
Pattern matching in Huffman encoded texts
DOI:10.1016/j.ipm.2003.08.008.png)
摘要
En 中文
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.
Keyword:
data compression
Huffman codes
pattern matching
compressed matching
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
6.9
论文数:
5.2K
被引数:
1.4W
机构
暂无机构信息
引用论文
Conformational properties of dinucleoside monophosphates in solution: dipurines and dipyrimidines
Biochemistry
IF0
Activation of Class III Ribonucleotide Reductase from E. coli. The Electron Transfer from the Iron−Sulfur Center to S-Adenosylmethionine
Biochemistry
IF0
Increased expression of CYP17A1 indicates an effective targeting of the androgen receptor axis in castration resistant prostate cancer (CRPC)
SpringerPlus
IF0

