Location of Repository

A taxonomy of suffix array construction algorithms

By Simon J. Puglisi, W. F. Smyth and Andrew H. Turpin

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

Topics: Categories and Subject Descriptors, E.1 [Data Structures, Arrays, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, H.3.3 [Information Storage and Retrieval, Information Search and Retrieval General Terms, Algorithms, Design, Performance Additional Key Words and Phrases, Suffix array, suffix tree, suffix sorting, Burrows–Wheeler transform ACM Reference Format
Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.184.992
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.seg.rmit.edu.au/res... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.