Combination of Sequitur and Leveinstein Algorithms for Text File Compression

Abstract

Data is one of the main things in computer science engineering (ICT) problems, data can mean a situation, image, sound, letter, number, mathematics, language or other symbols. Facts that often occur about data are the need for storage capacity and the need for Data transfer time, which is a case that must be observed in this requirement, is caused by the increasing amount of data that must be stored in RAM memory. Based on the results of the tests carried out: Files compressed by the sequitur algorithm make it easier to use the internet so that the time required will be shorter and the possibility of download and upload jobs failing will be smaller. Then transferring files over the network will be faster, the delivery time depends on whether the provider is fast or not and the size of the file to be sent and helps in reducing the size of the file so that it can reduce the storage capacity of a memory / RAM.

A text file is a collection of various related information in text form, text files originating from documents, letters, numbers and symbols will be compressed with a sequitur algorithm. The need for large storage capacity seems increasingly important. This need is caused by the increasing amount of data stored over time, especially for the business and banking world. These companies generally need very large capacity to store all important data and files.

The Leveinstein algorithm is a development of the sequitur algorithm, where a file approximates the difference between a string and the source string. The difference value between strings is expressed as the edit distance value. In contrast to the Leveintein algorithm which works on a character-by-character basis, the sequitur algorithm operates by enforcing uniqueness diagram constraints and usability rules.