Augmenting suffix trees, with applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 67-78

  Matias, Yossi ^a,b   Muthukrishnan, S ^b   Sahinalp, Süleyman Cenk ^c,d   Ziv, Jacob ^e  

^a TEL AVIV UNIVERSITY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF WARWICK   (United Kingdom)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

^e TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; FORESTRY;

ALGORITHMIC PROBLEMS; ALGORITHMICS; APPLICATION AREA; DIRECTED ACYCLIC GRAPHS; NEAR-LINEAR TIME; SUFFIX-TREES;

PROBLEM SOLVING;

EID: 84896750316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. T. Bell, T. Cleary, and I. Witten. Text Compression. Academic Press, 1990.
2. G. S. Brodal. Finger search trees with constant insertion time. In ACM-SIAM Symposium on Discrete Algorithms, 1998.
3. M. Burrows and D. J. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, DEC SRC, 1994.
4. M. Crochemore and W. Rytter. Text Algorithms. Oxford Press, 1994.
5. J. G. Cleary and I. H. Witten. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications, 32(4): 396-402, 1984.
6. D. M. Gusfield. Algorithms on Strings, Trees, and Sequences. Addison Wesley, 1998.
7. J. Hui. Color set size problem with applications to string matching. In Combinatorial Pattern Matching, 1992.
8. Y. Hershkovits and J. Ziv. On sliding window universal data compression with limited memory. In Information Theory symposium, pages 17-22, September 1995.
9. Y. Hershkovits and J. Ziv. On sliding window universal data compression with limited memory. IEEE Trans. on Information Theory, 44: 66-78, January 1998.
10. E. M. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 23(2): 262-272, April 1976.
11. M. Rodeh, V. Pratt, and S. Even. Linear algorithm for data compression via string matching. Journal of the ACM, 28(1): 16-24, January 1981.
12. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM Journal of Computing, 17: 1253-1262, 1988.
13. T.A. Welch. A technique for high-performance data compression. IEEE Computer, pages 8-19, January 1984.
14. M. J. Weinberger, J. J. Rissanen, and M. Feder. A universal finite memory source. IEEE Transactions on Information Theory, 41(3): 643-652, 1995.
15. H. Yokoo. An adaptive data compression method based on context sorting. In IEEE Data Compression Conference, 1996.
16. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(3): 337-343, May 1977.
17. J. Ziv and A. Lempel. Compression of individual sequences via variablerate coding. IEEE Transactions on Information Theory, IT-24(5): 530-536, September 1978.