Comparative Analysis of Sequitur Algorithm with Adaptive Huffman Coding Algorithm on Text File Compression with Exponential Method
Muhammad Noer Fadlan, Surya Darma Nasution, Fadlina, Saidi Ramadan Siregar, Pristiwanto · Zenodo (CERN European Organization for Nuclear Research) · 2017
This research was conducted to analyze and compare sequitur algorithm with the adaptive Huffman coding algorithm in compressing text file, to find which algorithm more effective and efficient in compressing compressed text file will be compared with an exponential method to be seen the performance of each algorithm based on CR, SS, RC. Text file compression will read the current string in the text file. In the Huffman adapting algorithm the text file coding will be changed into bit form, and the sequitur algorithm will change the file based on the grammar. The test result states that Huffman adapting coding algorithm is no better than sequitur algorithm.