.png){kind=icon}
返回
Off-line compression by greedy textual substitution
.png){kind=icon}
OA
AI
DOI：10.1109/5.892709.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Greedy off-line textual substitution refers to the following approach to compression or structural inference. Given a long textstring x, a substring w is identifies such that replacing all instances of w in x except one by a suitable pair of pointers yields the highest possible contraction of x; the process is then repeated on the contracted textstring until substrings capable of producing contractions can no longer be found. This paper examines computational issues arising in the implementation of this paradigm and describes some applications and experiments.
Keyword:
augmented suffix tree
compression of biological sequences
dynamic text compression
grammatical inference
off-line textual substitution
substring statistics
期刊
IF:
25.9
论文数:
9.9K
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容