We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Artificial Intelligence & Machine Learning/Perbandingan Algoritma Sequitur dan RLE Dalam Kompresi Teks
PeriodicalsArtificial Intelligence & Machine Learning

Perbandingan Algoritma Sequitur dan RLE Dalam Kompresi Teks

Checking your access to this record.

Abstract & Overview

Information on a news blog is not small if we look at the amount of information that will be conveyed in a news story. A news blog also uses a lot of storage memory in the database because of the large amount of information in the form of text that is stored, and also affects the speed of data transmission. Compression techniques aimed at reducing data can be used to reduce stored text and save storage media and speed up the data transmission process. Using the Sequitur algorithm is better with a compression ratio of 80.95% of the initial size, because the sequitur algorithm removes symbol pairs that appear more than once with a new symbol. While the RLE algorithm in this study cannot be used because it does not meet the RLE algorithm so that the compression process does not occur due to the absence of the same characters appearing successively, this is a weakness of the RLE algorithm

Cite this record

Rian Syahputra (2022). Perbandingan Algoritma Sequitur dan RLE Dalam Kompresi Teks. Bulletin of Artificial Intelligence., 1(1), 33–35. https://doi.org/10.62866/buai.v1i1.59

Copy in another style

Syahputra, R. (2022). Perbandingan Algoritma Sequitur dan RLE Dalam Kompresi Teks. Bulletin of Artificial Intelligence., 1(1), 33–35. https://doi.org/10.62866/buai.v1i1.59
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.