Abstract
In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the …
Cite
CITATION STYLE
APA
Siahaan, A. P. U., Aryza, S., Rahim, R., & Lubis, A. H. (2017). Comparison Between Dynamic And Static Blocks In Sequitur Algorithm. IOSR Journal of Computer Engineering, 19(04), 39–43. https://doi.org/10.9790/0661-1904013943
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free