A taxonomy of suffix array construction algorithms
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 abunda...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Association for Computing Machinery (ACM)
2007
|
| Online Access: | http://doi.acm.org/10.1145/1242471.1242472 http://hdl.handle.net/20.500.11937/16863 |
| _version_ | 1848749298776276992 |
|---|---|
| author | Puglisi, Simon Smyth, William Turpin, A. |
| author_facet | Puglisi, Simon Smyth, William Turpin, A. |
| author_sort | Puglisi, Simon |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T07:18:43Z |
| format | Journal Article |
| id | curtin-20.500.11937-16863 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:18:43Z |
| publishDate | 2007 |
| publisher | Association for Computing Machinery (ACM) |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-168632019-02-19T05:34:54Z A taxonomy of suffix array construction algorithms Puglisi, Simon Smyth, William Turpin, A. 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. 2007 Journal Article http://hdl.handle.net/20.500.11937/16863 http://doi.acm.org/10.1145/1242471.1242472 Association for Computing Machinery (ACM) restricted |
| spellingShingle | Puglisi, Simon Smyth, William Turpin, A. A taxonomy of suffix array construction algorithms |
| title | A taxonomy of suffix array construction algorithms |
| title_full | A taxonomy of suffix array construction algorithms |
| title_fullStr | A taxonomy of suffix array construction algorithms |
| title_full_unstemmed | A taxonomy of suffix array construction algorithms |
| title_short | A taxonomy of suffix array construction algorithms |
| title_sort | taxonomy of suffix array construction algorithms |
| url | http://doi.acm.org/10.1145/1242471.1242472 http://hdl.handle.net/20.500.11937/16863 |