The performance of linear time suffix sorting algorithms

Data Compression Conference Proceedings

Volumn , Issue , 2005, Pages 358-367

  Puglisi, Simon J ^a   Smyth, William F ^b   Turpin, Andrew ^c  

^a CURTIN UNIVERSITY   (Australia)

^b MCMASTER UNIVERSITY   (Canada)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26944451306     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2005.87     Document Type: Conference Paper

References (16)

1. th Australasian Workshop on Combinatorial Algorithms, Seok-Hee Hong (ed.) (2004) 148-156.
2. Michael Burrows & David J. Wheeler, A block-sorting lossless data compression algorithm, Research Report 124, Digital Equipment Corporation (1994).
3. th IEEE Symp. Found. Comp. Sci. (1997) 137-143.
4. R. Grossi & J. S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, Proc. 32nd ACM Symp. Theory of Computing (2000) 397-406.
5. th Internat. Colloq. Automata, Languages & Programming (2003) 943-955.
6. th Annual Symp. Combinatorial Pattern Matching, R. Baeza-Yates, E. Chávez & M. Crochemore (eds.), LNCS 2676, Springer-Verlag (2003) 186-199.
7. th Annual Symp. Combinatorial Pattern Matching, R. Baeza-Yates, E. Chávez & M. Crochemore (eds.), LNCS 2676, Springer-Verlag (2003) 200-210.
8. th Annual Symp. Combinatorial Pattern Matching, R. Baeza-Yates, E. Chávez & M. Crochemore (eds.), LNCS 2676, Springer-Verlag (2003) 55-69.
9. Stefan Kurtz, Reducing the space requirement of suffix trees, Software - Practice & Experience 29-13 (1999) 1149-1171.
10. N. Jesper Larsson & Kunihiko Sadakane, Faster Suffix Sorting, Technical Report LU-CS-TR:99-214, Lund University (1999) 20 pp.
11. th Australasian Workshop on Combinatorial Algorithms, Seok-Hee Hong (ed.) (2004) 64-72.
12. Udi Manber & Gene W. Myers, Suffix arrays: a new method for on-line string searches, SIAM J. Comput. 22-5 (1993) 935-948.
13. Giovanni Manzini & Paolo Ferragina, Engineering a lightweight suffix array construction algorithm, Algorithmica 40 (2004), 33-50.
14. Peter M. McIlroy, Keith Bostic & M. Douglas McIlroy, Engineering radix sort, Computing Systems 6-1 (1993) 5-27.
15. Kunihiko Sadakane, A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation, Proc. IEEE Data Compression Conference (1998) 129-138.
16. Julian Seward, On the performance of BWT sorting algorithms, Proc. IEEE Data Compression Conference (2000) 173-182.