compression

  1. Subset Sequence Frequency in Set

    Fast Algorithm to compute the most common prefixes in a large dataset.

    CS
  2. Burrows-Wheeler

    An implementation of the Burrows-Wheeler Transform which accepts either a String containing the value to be transformed, or a String , int to be reversed.

    thatguy2048
  3. Move To Front

    This is an implementation of the move-to-front transform .

    thatguy2048
1-3 of 3
  1. Burrows-Wheeler

    An implementation of the Burrows-Wheeler Transform which accepts either a String containing the value to be transformed, or a String , int to be reversed.

    thatguy2048
  2. Move To Front

    This is an implementation of the move-to-front transform .

    thatguy2048
  3. Subset Sequence Frequency in Set

    Fast Algorithm to compute the most common prefixes in a large dataset.

    CS
1-3 of 3
  1. Subset Sequence Frequency in Set

    Fast Algorithm to compute the most common prefixes in a large dataset.

    CS
  2. Move To Front

    This is an implementation of the move-to-front transform .

    thatguy2048
  3. Burrows-Wheeler

    An implementation of the Burrows-Wheeler Transform which accepts either a String containing the value to be transformed, or a String , int to be reversed.

    thatguy2048
1-3 of 3