The IJICS (International Journal of Informatics and Computer Science)
Vol 1, No 1 (2017): March 2017

Sequitur Algorithm For Particular Character Compression Or Words Always Returned

Efori Buulolo (Teknik Informatika STMIK Budi Darma)

Article Info

Publish Date
04 May 2017

Abstract

Character pairs or recurrent words are often found on large documents. The document uses a large space in storage. At this time the storage with a large amount of space is not a problem anymore, with the availability of various media types of large data storage media and the price is very affordable. Although in the form of storage media is not a problem but in the storage and transmission of data, a large document would need an efficient for storage space and so does the case of data transmission. The Sequitur algorithm is one suitable algorithm for concluding context-free grammar into a compression to reduce repetitive input. The Sequitur algorithm is perfect for large document compression with paired or repeated characters so that the document uses more efficient storage space in the case of data transmission

Copyrights © 2017




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
311.835 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
The IJICS (International Journal of Informatics and Computer Science)
Website

Abbrev

ijics

Publisher

Sekolah Tinggi Manajemen Informatika dan Komputer Budi Darma

Subject

Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering

Description

The The IJICS (International Journal of Informatics and Computer Science) covers the whole spectrum of intelligent informatics, which includes, but is not limited to : • Artificial Immune Systems, Ant Colonies, and Swarm Intelligence • Autonomous Agents and Multi-Agent Systems • Bayesian ...