Truncated suffix trees and their application to data compression

Theoretical Computer Science

Volumn 304, Issue 1-3, 2003, Pages 87-101

  Na, Joong Chae ^a   Apostolico, Alberto ^b   Iliopoulos, Costas S ^c,d   Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

^b UNIVERSITY OF PADOVA   (Italy)

^c KING'S COLLEGE LONDON   (United Kingdom)

^d CURTIN UNIVERSITY   (Australia)

Author keywords

Data compression; Data structure; Suffix tree; Text processing

Indexed keywords

ALGORITHMS; DATA COMPRESSION; TEXT PROCESSING; TREES (MATHEMATICS);

SUFFIX TREES;

DATA STRUCTURES;

EID: 0038148917     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00053-7     Document Type: Article

References (26)

1. Apostolico A. The myriad virtues of subword trees. Apostolico A., Galil Z. Combinatorial Algorithms on Words. 1985;85-95 Springer, Berlin.
2. Bell T.C. Better OPM/L text compression. IEEE Trans. Comm. COM-34(12):1986;1176-1182.
3. Bunton S. Semantically motivated improvements for PPM variants. Comput. J. 40(2-3):1997;76-93.
4. Crochemore M., Rytter W. Text Algorithms. 1994;Oxford University Press, Oxford.
5. M. Farach, Optimal suffix tree construction with large alphabets, Proc. of the 38th Annual Symp. on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, 1997, pp. 137-143.
6. Fiala E.R., Greene D.H. Data compression with finite windows. Comm. ACM. 32(4):1989;490-505.
7. Giegerich R., Kurtz S. From Ukkonen to McCreight and Weiner. a unifying view of linear-time suffix tree construction Algorithmica. 19(3):1997;331-353.
8. Gusfield D. Algorithms on Strings, Trees, and Sequences. 1997;Cambridge University Press, Cambridge.
9. D.S. Hirschberg, L.M. Stauffer, Parsing algorithms for dictionary compression on the PRAM, Proc. Data Compression Conf., IEEE Computer Society, Los Alamitos, 1994, pp. 136-145.
10. Hirschberg D.S., Stauffer L.M. Dictionary compression on the PRAM. Parallel Process. Lett. 7(3):1997;297-308.
11. J. Jiang, Implementing the PATRICIA data structure for compression algorithms with finite size dictionaries, Internat. Conf. on Data Transmission - Advances in Modem and ISDN Technology and Applications, IEE. 1992, London, pp. 123-127.
12. N.J. Larsson, Extended application of suffix trees to data compression, Proc. Data Compression Conf., IEEE Computer Society, Los Alamitos, 1996, pp. 190-199.
13. N.J. Larsson, The context trees of block sorting compression, Proc. Data Compression Conf., IEEE Computer Society, Los Alamitos, 1998, pp. 189-198.
14. Y. Matias, S. Muthukrishnan, S. Sahinalp, J. Ziv, Augmenting suffix trees with applications, Algorithms - ESA '98 6th Annual European Symp. Proc., Springer, Berlin, 1998, pp. 67-78.
15. McCreight E.N. A space-economical suffix tree construction algorithm. J. ACM. 23(2):1976;262-272.
16. V.S. Miller, M.N. Wegman, Variations on a theme by Ziv and Lempel, IEEE Inter, Conf. on Comm. '88: Digital Technology-Spanning the Universe, IEEE, New York, 1988, pp. 390-394.
17. Rodeh M., Pratt V.R., Even S. Linear algorithm for data compression via string matching. J. ACM. 28(1):1981;16-24.
18. K. Sadakane, Text compression using recency rank with context and relation to context sorting, block sorting and PPM*, Proc. Compression and Complexity of SEQ. 1997, IEEE Computer Society, Los Alamitos, 1998, pp. 305-319.
19. L.M. Stauffer, D.S. Hirschberg, PRAM algorithms for static dictionary compression, Proc. 8th Inter. Parallel Processing Symp., IEEE Computer Society, Los Alamitos, 1994, pp. 344-348.
20. Storer J.A., Szymanski T.G. Data compression via textual substitution. J. ACM. 29:1982;928-951.
21. Ukkonen E. On-line construction of suffix trees. Algorithmica. 14(3):1995;249-260.
22. P. Weiner, Linear pattern matching algorithms, 14th Annual Symp. on Switching Automata Theory, IEEE, New York, 1973, pp. 1-11.
23. Welch T.A. A technique for high-performance data compression. IEEE Comput. 17(6):1984;8-19.
24. Yu T.L. Data compression for PC software distribution. Software-Practice Experience. 26(11):1996;1181-1195.
25. Ziv J., Lempel A. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory IEEE. 23(3):1977;337-343.
26. Ziv J., Lempel A. Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, IEEE. 24(5):1978;530-536.