StringologyTimes

Data Compression Conference for Stringologist

Data Compression Conference 2004

  1. Merging Prediction by Partial Matching with Structural Contexts Model.
  2. Adapting the Knuth-Morris-Pratt Algorithm for Pattern Matching in Huffman Encoded Texts.
  3. Compressed Index for Dynamic Text.
  4. Dynamic Shannon Coding.
  5. Lempel-Ziv Compression of Structured Text.

Data Compression Conference 2001

  1. Pattern Matching in Huffman Encoded Texts.
  2. Space-Time Tradeoffs in the Inverse B-W Transform.
  3. Faster Approximate String Matching over Compressed Text.

Data Compression Conference 2000

  1. A New Compression Method for Compressed Matching.
  2. Implementing the Context Tree Weighting Method for Text Compression.

Data Compression Conference 1999

  1. A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression.
  2. Offline Dictionary-Based Compression.

Data Compression Conference 1998

  1. Some Theory and Practice of Greedy Off-Line Textual Substitution.
  2. Multiple Pattern Matching in LZW Compressed Text.
  3. On Optimality of Varients of the Block Sorting Compression.
  4. The Context Trees of Block Sorting Compression.
  5. A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation.

Data Compression Conference 1996

  1. Extended Application of Suffix Trees to Data Compression.
This site is open source. Improve this page.