A taxonomy of suffix array construction algorithms

Proceedings of the Prague Stringology Conference '05

Volumn , Issue , 2005, Pages 1-30

  Pulisi, Simon J ^a   Smyth, W F ^a,b   Turpin, Andrew ^c  

^a CURTIN UNIVERSITY   (Australia)

^b MCMASTER UNIVERSITY   (Canada)

^c RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION ALGORITHMS; EXPERIMENTAL TEST; HIGH LEVEL DESCRIPTION; SUFFIX ARRAYS; SUFFIX-TREES; TIME COMPLEXITY;

INDEXING (OF INFORMATION);

ALGORITHMS;

EID: 33750343074     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. [AK004] Mohamed Ibrahim Abouelhoda, Stefan Kurtz & Enno Ohlebuseh, Replacing suffix trees with enhanced suffix arrays, J. Discrete Alqs. 2 (2004) 53-86.
2. [BK03] Stefan Burkhardt & Juha Kärkkäinen, Fast lightweight suffix array construction and checking, Proc. 14-th Ann. Symp. Combinatorial Pattern Matching, LXCS 2676, Springer-Verlag (2003) 55-69,
3. [BM93] Jon L Bentley & M Douglas Mellroy, Engineering a sort function, Software - Practice & Experience 23-11 (1993) 1249-1265.
4. [BS97] Jon L. Bentley & Robert Sedgewick, Fast algorithms for sorting and searching strings, Proc. ACM-SIAM Symp, Discrete Algs. (1997) 360-369.
5. [BW94] Michael Burrows & David J. Wheeler, A Block-Sorting Lossless Data Compression Algorithm, Research Report 124, Digital Equipment Corporation (1994) 18 pp.
6. [CF02] Andreas Crauser & Paolo Ferragina, A theoretical and experimental study on the construction of suffix arrays in external memory, Algorithmica 32, 1 (2002) 1-35.
7. [F97] Martin Farach, Optimal suffix tree construction with large alpha bets, Proc. 38th IEEE Symp. Found. Comp. Sci. (1997) 137-143.
8. [FG99] Paolo Ferragina & Roberto Grossi, The string B-tree: a new data structure for string search in external memory and its applications, J. Assoc. Comput. Mach. 46-2 (1999) 236-280.
9. [GGV04] Roberto Grossi, Ankur Gupta & Jeffrey Scott Vitter, When indexing equals compression: experiments with compressing suffix arrays and applications, Proc. 15th ACM-SIAM Symp. Discrete Alas. (2004) 636-645.
10. [H04] Michael Hart, Project Gutenberg: http://www.gutenberg.net
11. [HSS03] Wing-Kai Hon, Kunihiko Sadakano & Wing-Kin Sung, Breaking a time-and-space barrier in constructing full-text indices, Proc. 44th IEEE Symp. Found. Comp. Sci. (2003) 251-260.
12. [IT99] Hideo Itoh & Hozumi Tanaka, An efficient method for in memory construction of suffix arrays, Proc. IEEE Symp. String Process. & Inform. Retrieval (1999) 81-88.
13. [K99] Stefan Kurtz, Reducing the space requirement of suffix trees, Software - Practice & Experience 29-13 (1999) 1149-1171.
14. [KA03] Pang Ko & Srinivas Aluru, Space Efficient Linear Time Construction of Suffix Arrays, Proc. 14th Ann. Symp. Combinatorial Pattern Matching, LXCS 2676, Springer-Verlag (2003) 200-210.
15. [KJP04]Dong Kyue Kim, Junha Jo & Heejin Park, A fast algorithm for constructing suffix arrays for fixed-size alphabets, Proc. Workshop on Experimental Algorithms. LXCS 3059, Springer-Verlag (2004) 301-314.
16. [KLAAP01] Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa & Kunsoo Park, Linear-time longest-common-prefix computation in suffix arrays and its applications, Proc. 12th Ann. Symp. Combinatorial Pattern Matching, LXCS 2089, Springer-Verlag (2001) 181-192.
17. [KMR72] Richard M. Karp, Raymond E. Miller & Arnold L. Rosenberg, Rapid identification of repeated patterns in strings, trees and arrays, Fourth Annual ACM Symp. Theory of Comput. (1972) 125-136.
18. [KS03] Juha Kärkkäinen & Peter Sanders, Simple Linear Work Suffix Array Construction, Proc. 30th Internat. Colloq. Automata, Languages & Programming, LXCS 2719, Springer-Verlag (2003) 943-955.
19. [KSPP03] Dong Kyue Kim, Jeong Seop Sim, Heejin Park & Kunsoo Park, Lineartime Construction of Suffix Arrays, Proc. 14th Ann. Symp. Combinatorial Pattern Matching, LXCS 2676, Springer-Verlag (2003) 186-199.
20. [LP04] Sunglim Lee & Kunsoo Park, Efficient implementations of suffix array construction algorithms, Proc. 15th, Australasian Workshop on Combinatorial Algs., Seok-Hee Hong (ed.) (2004) 64-72.
21. [LS99] X. Jesper Larsson & Kunihiko Sadakane, Faster Suffix Sorting, Technical Report LU-CS-TR:99-214, Lund University (1999) 20 pp.
22. [M97] M. Douglas Mcllroy, ssort.c: http://cm.bell-labs.com/cm/cs/who/doug/source.html
23. [M99] J. Ian Munro, Succinct data structures, Proc. Workshop on Data Structures (1999) 3-7.
24. [M04] Giovanni Manzini, Two space saving tricks for linear time LCP array computation, Proc. Scandinavian Workshop on Aiqorithm Theory (2004) 372-383.
25. [M05] Michael Maniscalco, MSufSort: http://www.michael-maniscalco.com/
26. [MBM93] Peter M. Mellroy, Keith Bostic & M. Douglas Mellroy, Engineering radix sort, Computing Systems 6-1 (1993) 5-27.
27. [MF04] Giovanni Manzini & Paolo Ferragina, Engineering a lightweight suffix array construction algorithm, Algorithmica 4-0 (2004) 33-50.
28. [MM90] Udi Manber & Gene W. Myers, Suffix Arrays: A new method for on-line string searches, Proc. First ACM-SIAM Symp. Discrete Alas. (1990) 319-327.
29. [MM93] Udi Manber & Gene W. Myers, Suffix Arrays: A new method for on-line string searches, SIAM J. Comput. 22 (1993) 935-948.
30. [X05] Jeong Chae Xa, Linear-time construction of compressed suffix arrays using 0(n·logn)-bit working space for large alphabets, Proc. 16th Ann. Symp. Combinatorial Pattern Matching, LXCS 3537, Springer-Verlag (2005) 57-67.
31. [P05] Simon J. Puglisi, Exposition and analysis of a suffix sorting algorithm. Technical Report CAS-05-02-WS, Department of Computing and Software, McMaster University (2005) 19 pp.
32. [PST05] Simon J. Puglisi, Bill F. Smyth & Andrew Turpin, The performance of linear time suffix sorting algorithms, Proc. Data Compression Conf. (2005) 358-367.
33. [S98] Kunihiko Sadakane, A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation, Proc. Data Compression Conf. (1998) 129-138.
34. [S00] Julian Seward, On the performance of BWT sorting algorithms, Proc. Data Compression Conf. (2000) 173-182.
35. [S031] Bill F. Smvth, Computing Patterns in Strings, Pearson Addison-Weslev (2003) 423 pp.
36. [SKPP03] Jeong Seop Sim, Dong Kyue Kim, Heejin Park & Kunsoo Park, Lineartime search in suffix arrays, Proc. 14th Australasian Workshop on Combinatorial Algs. (2003) 139-146.
37. [SZ04] Ranjan Sinha & Justin Zobel, Cache-conscious sorting of large sets of strings with dynamic tries ACM J. Experimental Algs. 9 (2004) 1-31.
38. [SS05] Klaus-Bernd Schiirmann & Jens Stove, An incomplex algorithm for fast suffix array construction, Proc. 7th Workshop on Algorithm Engineering & Experiments