Chris Pollett > Students > He

    Print View

    [Bio]

    [CS 297 Proposal]

    [Blog]

    [Deliverable #1:EPUB.ppt]

    [Deliverable #2:an sample EPUB book]

    [Deliverable #3:JS Sequitur algorithm]

    [Deliverable #4:DB schema design]

    [CS297 Report PDF]

    [CS298 Proposal]

    [CS298 Report PDF]

    [CS298 Presentation PDF]

    [CS298 source code zip file]

                          

























SEQUITUR algorithm in JavaScript

Description:I had implemented one grammar_based compression algorithm SEQUITUR using JavaScript.

Example:You can test how my algorithm works with any length of character strings.

Currently, it supports characters only, that is, no numbers, no special characters :-)

Demo:

Please enter the string which you want to compress:

The compressed result is:




More!

Have a try to decompress the previous compressed result:

Then get the original string which is: