Grammar compression by induced suffix sorting

Nunes, Daniel Saad Nogueira; Louza, Felipe A.; Gog, Simon; Ayala-Rincón, Mauricio; Navarro, Gonzalo

Registro completo de metadados

Campo DC	Valor	Idioma
dc.contributor.author	Nunes, Daniel Saad Nogueira	-
dc.contributor.author	Louza, Felipe A.	-
dc.contributor.author	Gog, Simon	-
dc.contributor.author	Ayala-Rincón, Mauricio	-
dc.contributor.author	Navarro, Gonzalo	-
dc.date.accessioned	2022-12-05T18:20:59Z	-
dc.date.available	2022-12-05T18:20:59Z	-
dc.date.issued	2022-08-26	-
dc.identifier.citation	NUNES, Daniel S. N. et. al. Grammar compression by induced suffix sorting. ACM Journal of Experimental Algorithmics, v. 27, dez. 2022. DOI 10.1145/3549992. Disponível em: https://dl.acm.org/doi/10.1145/3549992. Acesso em: 05 dez. 2022.	pt_BR
dc.identifier.uri	https://repositorio.unb.br/handle/10482/45251	-
dc.language.iso	Inglês	pt_BR
dc.publisher	ACM	pt_BR
dc.rights	Acesso Restrito	pt_BR
dc.title	Grammar compression by induced suffix sorting	pt_BR
dc.type	Artigo	pt_BR
dc.subject.keyword	Teoria da computação	pt_BR
dc.subject.keyword	Compressão de dados (Computação)	pt_BR
dc.subject.keyword	Gestão de dados	pt_BR
dc.subject.keyword	Algoritmo de compressão gramatical	pt_BR
dc.identifier.doi	https://doi.org/10.1145/3549992	pt_BR
dc.relation.publisherversion	https://dl.acm.org/doi/10.1145/3549992	pt_BR
dc.description.abstract1	A grammar compression algorithm, called GCIS, is introduced in this work. GCIS is based on the induced suffix sorting algorithm SAIS, presented by Nong et al. in 2009. The proposed solution builds on the factorization performed by SAIS during suffix sorting. A context-free grammar is used to replace factors by non-terminals. The algorithm is then recursively applied on the shorter sequence of non-terminals. The resulting grammar is encoded by exploiting some redundancies, such as common prefixes between right-hands of rules, sorted according to SAIS. GCIS excels for its low space and time required for compression while obtaining competitive compression ratios. Our experiments on regular and repetitive, moderate and very large texts, show that GCIS stands as a very convenient choice compared to well-known compressors such as Gzip 7-Zip; and RePair the gold standard in grammar compression; and recent compressors such as SOLCA, LZRR, and LZD. In exchange, GCIS is slow at decompressing. Yet, grammar compressors are more convenient than Lempel-Ziv compressors in that one can access text substrings directly in compressed form without ever decompressing the text. We demonstrate that GCIS is an excellent candidate for this scenario, because it shows to be competitive among its RePair based alternatives. We also show that the relation with SAIS makes GCIS a good intermediate structure to build the suffix array and the LCP array during decompression of the text.	pt_BR
dc.identifier.orcid	https://orcid.org/0000-0001-6870-1397	pt_BR
dc.identifier.orcid	https://orcid.org/0000-0003-2931-1470	pt_BR
dc.identifier.orcid	https://orcid.org/0000-0002-5450-8630	pt_BR
dc.identifier.orcid	https://orcid.org/0000-0003-0089-3905	pt_BR
dc.identifier.orcid	https://orcid.org/0000-0002-2286-741X	pt_BR
Aparece nas coleções:	Artigos publicados em periódicos e afins