A taxonomy of suffix array construction algorithms

  • Authors:

  • Simon J. Puglisi;W. F. Smyth;Andrew H. Turpin

  • Affiliations:

  • Curtin University of Technology, Melbourne, Australia;McMaster University and Curtin University of Technology, Hamilton, ON, Canada;RMIT University, Melbourne, Australia

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

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.