Compression Links: Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching

website 0.3 Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching http://www.cs.duke.edu/~jsv/Papers/catalog/node79.html
rating: not rated

R. Grossi and J. S. Vitter. ``Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching,'' Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC '00), Portland, OR, May 2000, 397-406.

Link categories:

Suffix Trees (area)
Papers/Documentation (content)

Created: 08 Apr 2002 00:00 by Mark Nelson
Published: 08 Apr 2002 00:00
Last Updated: 08 Apr 2002 00:00 by Mark Nelson

Other links to site duke.edu:

18 links to this site were found

23/03/2005 Dictionary Selection using Partial Matching
23/03/2005 Parallel Lossless Image Compression Using Huffman and Arithmetic Coding
05/03/2005 Efficient Algorithms for MPEG Video Compression
28/07/2002 Error Modeling for Hierarchical Lossless Image Compression
28/07/2002 Explicit Bit Minimization for Motion-Compensated Video Coding
28/07/2002 Text Compression via Alphabet Re-representation
08/04/2002 FELICS - Fast and Efficient Lossless Image Compression
08/04/2002 Fast Progressive Lossless Image Compression
08/04/2002 Arithmetic Coding for Data Compression
08/04/2002 Huffman Coding: A CS2 Assignment
07/04/2002 Design and Analysis of Dynamic Huffman Codes
07/04/2002 Practical Implementations of Arithmetic Coding
07/04/2002 Nearly Optimal Vector Quantization via Linear Programming
07/04/2002 Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding
30/12/2001 Analysis of Arithmetic Coding for Data Compression