Better external memory suffix array construction

ACM Journal of Experimental Algorithmics

Volumn 12, Issue , 2008, Pages

  Dementiev, Roman ^a   Kärkkäinen, Juha ^b   Mehnert, Jens ^c   Sanders, Peter ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF HELSINKI   (Finland)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithm engineering; Algorithms for strings; External memory; I O efficient; Large data sets; Secondary memory; Suffix array

Indexed keywords

EID: 51149088571     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1227161.1402296     Document Type: Article

References (30)

1. ABOUELHODA, M. I., KURTZ, S., AND OHLEBUSCH, E. 2002. The enhanced suffix array and its applications to genome analysis. In Proc. 2nd Workshop on Algorithms in Bioinformatics. LNCS, vol. 2452. Springer, New York. 449-463.
2. AGGARWAL, A. AND VITTER, J. S. 1988. The input/output complexity of sorting and related problems. Commun. ACM 31, 9, 1116-1127.
3. ARGE, L., FERRAGINA, P., GROSSI, R., AND VITTER, J. S. 1997. On sorting strings in external memory. In 29th ACM Symposium on Theory of Computing. ACM Press, New York. 540-548.
4. ARGE, L., PROCOPIUC, O., AND VITTER, J. S. 2002. Implementing I/O-efficient data structures using TPIE. In Proc. 10th Annual European Symposium on Algorithms. LNCS, vol. 2461. Springer, New York. 88-100.
5. BURKHARDT, S. AND KÄRKKÄINEN, J. 2003. Fast lightweight suffix array construction and checking. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching. LNCS, vol. 2676. Springer, New York. 55-69.
6. BURROWS, M. AND WHEELER, D. J. 1994. A block-sorting lossless data compression algorithm. Technical Report 124, SRC (digital, Palo Alto) (May).
7. CRAUSER, A. AND FERRAGINA, P. 1999. On constructing suffix arrays in external memory. In Proc. 7th Annual European Symposium on Algorithms. LNCS, vol. 1643. 224-235.
8. CRAUSER, A. AND FERRAGINA, P. 2002. Theoretical and experimental study on the construction of suffix-arrays in external memory. Algorithmica 32, 1, 1-35.
9. CRAUSER, A. AND MEHLHORN, K. 1998. LEDA-SM a platform for secondary memory computations. Tech. rep., MPII. draft.
10. DEMENTIEV, R. 2005. The Stxxl library. Documentation and download at http://stxxl. sourceforge.net.
11. DEMENTIEV, R. AND SANDERS, P. 2003. Asynchronous parallel disk sorting. In Proc. 15th Annual Symposium on Parallelism in Algorithms and Architectures. San Diego, CA. 138-148.
12. DEMENTIEV, R., KETTNER, L., AND SANDERS, P. 2005. Stxxl: Standard Template Library for XXL Data Sets. In Proc. 13th Annual European Symposium on Algorithms. LNCS, vol. 3669. 640-651.
13. FARACH-COLTON, M., FERRAGINA, P., AND MUTHUKRISHNAN, S. 2000. On the sorting-complexity of suffix tree construction. Journal of the ACM 47, 6, 987-1011.
14. GONNET, G., BAEZA-YATES, R., AND SNIDER, T. 1992. New indices for text: PAT trees and PAT arrays. In Information Retrieval: Data Structures & Algorithms, W. B. Frakes and R. Baeza-Yates, Eds. Prentice-Hall, Englewood Cliffs, NJ.
15. GROPP, W., LUSK, R., AND THAKUR, R. 1998. Latest Advances in MPI-2. Tutorial on EuroPVM/ MPI'98.
16. HAANPÄÄ, H. 2004. Minimum sum and difference covers of Abelian groups. Journal of Integer Sequences 7, 2, article 04.1.8.
17. HON, W.-K., LAM, T.-W., SADAKANE, K., AND SUNG, W.-K. 2003a. Constructing compressed suffix-arrays with large alphabets. In a Proc. 14th International Symposium on Algorithms and Computation. LNCS, vol. 2906. Springer, New York. 240-249.
18. HON, W.-K., SADAKANE, K., AND SUNG, W.-K. 2003b. Breaking a time-and-space barrier in constructing full-text indices. In Proc. 44th Annual Symposium on Foundations of Computer Science. IEEE, Los Alamitos, CA. 251-260.
19. KÄRKKÄINEN, J. 2003. Algorithms for Memory Hierarchies. LNCS, vol. 2625, Chapter Full-Text Indexes in External Memory. Springer, New York. 171-192.
20. KÄRKKÄINEN, J., SANDERS, P., AND BURKHARDT, S. 2006. Linear work suffix array construction. Journal of the ACM 53, 6, 1-19.
21. KIM, D. K., SIM, J. S., PARK, H., AND PARK, K. 2003. Linear-time construction of suffix arrays. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching. LNCS, vol. 2676. Springer, New York. 186-199.
22. KO, P. AND ALURU, S. 2003. Space efficient linear-time construction of suffix-arrays. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching. LNCS, vol. 2089. Springer, New York. 200-210.
23. KULLA, F. AND SANDERS, P. 2006. Scalable parallel suffix array construction. In EuroPVM / MPI. to appear.
24. LAM, T.-W., SADAKANE, K., SUNG, W.-K., AND YIU, S.-M. 2002. A space and time efficient algorithm for constructing compressed suffix arrays. In Proc. 8th Annual International Conference on Computing and Combinatorics. LNCS, vol. 2387. Springer, New York. 401-410.
25. MANBER, U. AND MYERS, G. 1993. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22, 5 (Oct.), 935-948.
26. MANZINI, G. AND FERRAGINA, P. 2002. Engineering a lightweight suffix array construction algorithm. In Proc. 10th Annual European Symposium on Algorithms. LNCS, vol. 2461. Springer, New York. 698-710.
27. SADAKANE, K. AND SHIBUYA, T. 2001. Indexing huge genome sequences for solving various problems. Genome Informatics 12, 175-183.
28. SILBERSCHATZ, A., KORTH, H. F., AND SUDARSHAN, S. 2001. Database System Concepts, 4th ed. McGraw-Hill, New York.
29. VITTER, J. S. AND SHRIVER, E. A. M. 1994. Algorithms for parallel memory, I: Two level memories. Algorithmica 12, 2/3, 110-147.
30. WEESE, D. 2006. Entwurf und Implementierung eines generischen Substring-Index. M.S. thesis, Freie Universität Berlin.