Browse > Article

Improvement of Practical Suffix Sorting Algorithm  

Jeong, Tae-Young (서울대학교 전기컴퓨터공학부)
Lee, Tae-Hyung (서울대학교 전기컴퓨터공학부)
Park, Kun-Soo (서울대학교 전기컴퓨터공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.36, no.2, 2009 , pp. 68-72 More about this Journal
Abstract
The suffix array is a data structure storing all suffixes of a string in lexicographical order. It is widely used in string problems instead of the suffix tree, which uses a large amount of memory space. Many researches have shown that not only the suffix array can be built in O(n), but also it can be constructed with a small time and space usage for real-world inputs. In this paper, we analyze a practical suffix sorting algorithm due to Maniscalco and Puglisi [1], and we propose an efficient algorithm which improves Maniscalco-Puglisi's running time.
Keywords
Suffix Array; Suffix Sorting; Multi-key Quick Sort;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Maniscalco, M., and Puglisi, S. aster lightweight suffix array construction. In Proceedings of 17th Australasion Workshop on Combinatorial Algorithms, pp. 16-29.2006.
2 Manber, U., and Myer, G. Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing 22, 5, pp. 935-948, 1993.   DOI   ScienceOn
3 Kim, D. K. Sim, J. S., Park, H., and Park, K. Constructing suffix arrays in linear time. Journal of Discrete Algorithms 3, 2-4, pp. 126-142. 2005.   DOI   ScienceOn
4 Ko, P., and Aluru, S. Space efficient linear time construction of suffix array construction algorithms. ACM Computing Surveys 39, 2, 2007.
5 Itoh, H., and Tanska, H. An eficient method for in memory construction of suffix arrays. In Proceedings of the String Processing and Information Retrieval, p. 81. 1999.   DOI
6 Karkkainen, J., Sanders, P., and Burkhardt, S. Linear work sufix aray construction. Journal of the ACM 53, 6, pp. 918-936, 2006.   DOI   ScienceOn
7 Mori, y. Divsufsort (version 1.2.3). http://www.homepage3.nifty.com/wpage/software/livbdivsufsort.html, 2005.
8 Manzini, G., and Ferragina, P. Engineering a lightweight suffix array contruction algorithm. Algorithmica 40, 1, pp. 33-50. 2004.   DOI   ScienceOn
9 Bentley, J. L., and Sedgewick, R. Fast algorithms for sorting and searching strings. In Proceedings of ACM-SLAM Symposium on Discrete Algorithms. pp. 360-369, 1997.
10 Pglisi, S. J., Smyth, W. F., and Turpin, A. H. A taxonomy of suffix aray construction algorithms. ACM Computing Surveys 39, 2, 2007.
11 Bentley, J. L., and Mcllroy, M. D. Engineering a sort function. Sotware-Practice & Experience 23, 11, pp. 1249-1265, 1993.   DOI   ScienceOn