Journal article
A taxonomy of suffix array construction algorithms
ACM Computing Surveys, Vol.39(2)
2007
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.
Details
- Title
- A taxonomy of suffix array construction algorithms
- Authors/Creators
- S.J. Puglisi (Author/Creator) - Curtin UniversityW.F. Smyth (Author/Creator) - McMaster UniversityA.H. Turpin (Author/Creator) - RMIT University
- Publication Details
- ACM Computing Surveys, Vol.39(2)
- Publisher
- ACM Digital Library
- Identifiers
- 991005542913507891
- Copyright
- 2007 ACM
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
82 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Citation topics
- 4 Electrical Engineering, Electronics & Computer Science
- 4.182 Data Structures, Algorithms & Complexity
- 4.182.1103 Efficient Algorithms
- Web Of Science research areas
- Computer Science, Theory & Methods
- ESI research areas
- Computer Science