An incomplex algorithm for fast suffix array construction

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 77-85

  Schürmann, Klaus Bernd ^a   Stoye, Jens ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES;

ARRAY CONSTRUCTION; CONSTRUCTION TIMES;

ALGORITHMS;

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

References (21)

1. J. L. Bentley and M. D. McIlroy. Engineering a sort function. Software: Practice and Experience, 23(11):1249-1265, November 1993.
2. J. L. Bentley and R Sedgewick. Fast algorithms for sorting and searching strings. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pages 360-369, January 1997.
3. S. Burkhardt and J. Kärkkäinen. Fast lightweight suffix array construction and checking. In Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPM 2003), volume 2676 of Lecture Notes in Computer Science, pages 55-69. Springer Verlag, June 2003.
4. M. Burrows and D.J. Wheeler. A block-sorting loss-less data compression algorithm. Technical Report Research Report 124, Digital System Research Center, May 1994.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, first edition, 1989.
6. M. Farach. Optimal suffix tree construction with large alphabets. In Proceedings of the 38th Annual Symposium on the Foundations of Computer Science (FOCS 1997), pages 137-143, October 1997.
7. M. Farach, P. Ferragina, and S. Muthukrishnan. On the sorting-complexity of suffix tree construction. Journal of the ACM, 47(6):987-1011, November 2000.
8. W.-K. Hon, K. Sadakane, and W.-K. Sung. Breaking a time-and-space barrier in constructing full-text indices. In Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), pages 251-260. IEEE Computer Society, October 2003.
9. H. Itoh and H. Tanaka. An efficient method for in memory construction of suffix arrays. In Proceedings of String Processing and Information Retrieval Symposium and International Workshop on Groupware, (SPIRE/CRIWG 1999), pages 81-88. IEEE Computer Society Press, September 1999.
10. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), volume 2719 of Lecture Notes in Computer Science, pages 943-955. Springer Verlag, June 2003.
11. R. M. Karp, R. E. Miller, and A. L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. In Proceedings of the 4th ACM Symposium on Theory of Computing (STOC 1972), pages 125-136. ACM Press, May 1972.
12. D. K. Kim, J. Jo, and H. Park. A fast algorithm for constructing suffix arrays for fixed-size alphabets. In Celso C. Ribeiro and Simone L. Martins, editors, Proceedings of the 3rd International Workshop on Experimental and Efficient Algorithms (WEA 2004), volume 3059 of Lecture Notes in Computer Science, pages 301-314. Springer Verlag, May 2004.
13. D. K. Kim, J. S. Sim, H. Park, and K. Park. Linear-time construction of suffix arrays. In Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPU 2003), volume 2676 of Lecture Notes in Computer Science, pages 186-199. Springer Verlag, June 2003.
14. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays. In Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPM 2003), volume 2676 of Lecture Notes in Computer Science, pages 200-210. Springer Verlag, June 2003.
15. S. Kurtz. Reducing the space requirements of suffix trees. Software: Practice and Experience, 29(13):1149-1171, November 1999.
16. N. J. Larsson and K. Sadakane. Faster suffix sorting. Technical Report LU-CS-TR:99-214, LUNDFD6/(NFCS-3140)/1-20/(1999), Department of Computer Science, Lund University, May 1999.
17. U. Manber and E. W. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, October 1993.
18. G. Manzini and P. Ferragina. Engineering a lightweight suffix array construction algorithm. Algorithmica, 40(1):33-50, June 2004.
19. P.M. McIlroy, K. Bostic, and M.D. McIlroy. Engineering radix sort. Computing Systems, 6(1):5-27, 1993.
20. J. Seward. On the performance of BWT sorting algorithms. In Proceedings of the Data Compression Conference (DCC 2000), pages 173-182. IEEE Computer Society, March 2000.
21. R. C. Singleton. ACM Algorithm 347: an efficient algorithm for sorting with minimal storage. Communications of the ACM, 12(3):185-187, March 1969.