Compression Links: From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction

website 0.3 From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction http://citeseer.ist.psu.edu/giegerich97from.html
rating: not rated

1997, Robert Giegerich, Stefan Kurtz. We review the linear time suffix tree constructions by Weiner, McCreight, and Ukkonen. We use the terminology of the most recent algorithm, Ukkonen's online construction, to explain its historic predecessors. The submitter of this paper indicates that it has user-friendly terminology, always welcome in Journal papers.

Link categories:

Suffix Trees (area)
Papers/Documentation (content)

Created: 16 Nov 2002 00:00 by Mark Nelson
Published: 16 Nov 2002 00:00
Last Updated: 06 Aug 2005 01:52 by Dmitriy Vatolin

Other links to site psu.edu:

19 links to this site were found

06/08/2005 An Entropy Primer
21/05/2005 A Block-sorting Lossless Data Compression Algorithm
12/09/2004 Genetic Algorithms for Fractal Image and Image Sequence Compression
12/10/2002 Entropy in Information and Coding Theory
12/10/2002 Entropy on the World Wide Web
29/09/2002 Application of the BSP Model in Fractal Image Compression
28/09/2002 A Non Uniform Segmentation Optimal Hybrid Fractal/dct Image Compression Algorithm
28/09/2002 Algorithm for Fast Fractal Image Compression
16/07/2002 Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting
03/02/2002 A Known Plaintext Attack on the PKZIP Stream Cipher
02/01/2002 CiteSeer Compression References
01/01/2002 Lossless Transform Coding of Audio Signals.
17/12/2001 Context Weighting for General Finite-Context Sources,
17/12/2001 The Context Tree Weighting Method: Basic Properties
07/12/2001 Shorten Technical Report