| Texto completo | |
| Autor(es): |
Louza, Felipe A.
;
Mantaci, Sabrina
;
Manzini, Giovanni
;
Sciortino, Marinella
;
Telles, Guilherme P.
Número total de Autores: 5
|
| Tipo de documento: | Artigo Científico |
| Fonte: | STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2019; v. 11811, p. 14-pg., 2019-01-01. |
| Resumo | |
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in O(n) time using sigma + O(1) words of working space, where n is the length of the text and s is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use O(n) words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not only space-efficient but also fast in practice. (AU) | |
| Processo FAPESP: | 17/09105-0 - Ordenação de sufixos e medidas de similaridade entre cadeias |
| Beneficiário: | Felipe Alves da Louza |
| Modalidade de apoio: | Bolsas no Brasil - Pós-Doutorado |