Please use this identifier to cite or link to this item:
Type: Congresso
Title: Induced Suffix Sorting For String Collections
Author: Louza
Felipe A.; Gog
Simon; Telles
Guilherme P.
Abstract: Sorting all suffixes of a string collection may be performed by sorting the concatenation of all strings using different end marker symbols as separators, or alternatively using the same end marker as separator. However, both approaches have the following drawbacks. The first alternative increases the alphabet size of the resulting string by the number of strings, whereas the second alternative does not guarantee the order among suffixes that are equal up to the end marker symbol. In this article, we show how to modify two important suffix sorting algorithms, SAIS [1] and SACA-K [2], to sort the concatenated string using the same end marker, maintaining their theoretical their theoretical bounds, respecting the order among all suffixes, and improving their practical performance.
Editor: IEEE
New York
Citation: 2016 Data Compression Conference (dcc). Ieee, p. 43 - 52, 2016.
Rights: fechado
Identifier DOI: 10.1109/DCC.2016.27
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000391353800005.pdf345.97 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.