Suffix arrays: what are they good for?
MetadataShow full item record
Recently the theoretical community has displayed a flurry of interest in suffix arrays, and compressed suffix arrays. New, asymptotically optimal algorithms for construction, search, and compression of suffix arrays have been proposed. In this talk we will present our investigations into the practicalities of these latest developments. In particular, we investigate whether suffix arrays can indeed replace inverted files, as suggested in recent literature on suffix arrays.
Copyright © 2006, Australian Computer Society, Inc. This paper appeared at the Seventeenth Australasian Database Conference (ACSC2006), Hobart, Australia. Conferences in Research and Practice in Information Technology, Vol. 49. Gillian Dobbie and James Bailey, Ed. Reproduction for academic, not for profit purposes permitted provided this text is included.
Showing items related by title, author, creator and subject.
Puglisi, Simon; Smyth, William; Turpin, A. (2007)In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, and especially in the last few ...
Chen, G.; Puglisi, Simon; Smyth, B. (2008)For 30 years the Lempel-Ziv factorization LZ x of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) ...
Puglisi, Simon; Smyth, William; Turpin, Andrew (2006)Recent advances in the asymptotic resource costs of pattern matching with compressed suffix arrays are attractive, but a key rival structure, the compressed inverted file, has been dismissed or ignored in papers presenting ...