LINEAR ALGORITHM FOR DATA-COMPRESSION VIA STRING MATCHING

被引：115

作者：

RODEH, M

PRATT, VR

EVEN, S

机构：

[1] TECHNION ISRAEL INST TECHNOL, HAIFA, ISRAEL

[2] MIT, CAMBRIDGE, MA 02139 USA

来源：

关键词：

D O I：

10.1145/322234.322237

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：16 / 24

页数：9

共 12 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

ELIAS P, 1975, IEEE T INFORM THEORY, V21, P194, DOI 10.1109/TIT.1975.1055349

[3] ECONOMICAL ENCODING OF COMMAS BETWEEN STRINGS [J].

EVEN, S ;

RODEH, M .

[4] COMPLEXITY OF FINITE SEQUENCES [J].

LEMPEL, A ;

ZIV, J .

[5]

LEVINSTEIN VE, 1968, PROBL CYBERNETICS, V20, P173

[6] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J].

MCCREIGHT, EM .

[7]

PRATT VR, UNPUBLISHED

[8]

RODEH M, 1979, TR70 IBM ISR SCI CTR

[9]

SHPERLING I, 1975, ASYMPTOTIC COMPLEXIT

[10]

Weiner P., 1973, 14th Annual Symposium on Switching Automata Theory, P1