A taxonomy of suffix array construction algorithms

Puglisi, S, Smyth, W and Turpin, A 2005, 'A taxonomy of suffix array construction algorithms', in J. Holub and M. Simanek (ed.) Proceedings of the Prague Stringology Conference, Prague, 2007.

Document type: Conference Paper
Collection: Conference Papers

Title A taxonomy of suffix array construction algorithms
Author(s) Puglisi, S
Smyth, W
Turpin, A
Year 2005
Conference name Prague Stringology Conference
Conference location Prague
Conference dates 2007
Proceedings title Proceedings of the Prague Stringology Conference
Editor(s) J. Holub
M. Simanek
Publisher Prague Stringology Club
Place of publication Prague
Abstract 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 years, suffix array construction algorithms have proliferated in bewildering abundance. This survey paper attempts to provide simple high-level descriptions of these numerous algorithms that highlight both their distinctive features and their commonalities, while avoiding as much as possible the complexities of implementation details. New hybrid algorithms are also described. We provide comparisons of the algorithms' worst-case time complexity and use of additional space, together with results of recent experimental test runs on many of their implementations.
Subjects Information Systems not elsewhere classified
Keyword(s) algorithms
suffix array
suffix tree
suffix sorting
Burrows–Wheeler transform
DOI - identifier 10.1145/1242471.1242472
Copyright notice © 2007 ACM
Version Filter Type
Altmetric details:
Access Statistics: 234 Abstract Views  -  Detailed Statistics
Created: Wed, 08 Apr 2009, 09:42:32 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us