Practical linear-time O(1)-workspace suffix sorting for constant alphabets

ACM Transactions on Information Systems

Volumn 31, Issue 3, 2013, Pages 1-15

  Nong, Ge ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Linear time; O(1) workspace; Sorting algorithm; Suffix array

Indexed keywords

INFORMATION SYSTEMS;

CONSTRUCTION ALGORITHMS; LINEAR TIME; MEMORY USAGE; SORTING ALGORITHM; SPACE EFFICIENT; SUFFIX ARRAYS; SUFFIX SORTING; TIME ALGORITHMS;

COMPUTER NETWORKS;

EID: 84893957402     PISSN: 10468188     EISSN: 15582868     Source Type: Journal    
DOI: 10.1145/2493175.2493180     Document Type: Article

References (20)

1. BURKHARDT, S. AND KäRKKäINEN, J. 2003. Fast lightweight suffix array construction and checking. In Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 2676, Spriger Verlag, Berlin Heidelberg, 55-69.
2. DEMENTIEV, R., KäRKKäINEN, J., MEHNERT, J., AND SANDERS, P. 2008. Better external memory suffix array construction. ACM J. Exp. Algor. 12.
3. FERRAGINA, P., GAGIE, T., AND MANZINI, G. 2012. Lightweight data indexing and compression in external memory. Algorithmica 63, 3, 707-730.
4. FISCHER, J. 2011. Inducing the LCP-Array. In Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 6844, Spriger Verlag, Berlin Heidelberg, 374-385.
5. FRANCESCHINI, G. ANDMUTHUKRISHNAN, S. 2007. In-place suffix sorting. In Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 4596, Spriger Verlag, Berlin Heidelberg, 533-545.
6. HON, W. K., SADAKANE, K., AND SUNG, W. K. 2003. Breaking a time-And-space barrier for constructing fulltext indices. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'03). 251-260.
7. ITOH, H. AND TANAKA, H. 1999. An efficient method for in memory construction of suffix arrays. In Proceedings of the String Processing and Information Retrieval Symposium and International Workshop on Groupware (SPIRE'99). 81-88.
8. KäRKKäINEN, J., SANDERS, P., AND BURKHARDT, S. 2006. Linear work suffix array construction. JACM 53, 6, 918-936.
9. KIM, D. K., JO, J., PARK, H., AND PARK, K. 2005. Constructing suffix arrays in linear time. J. Disc. Algor. 3, 2-4, 126-142.
10. KO, P. AND ALURU, S. 2005. Space-efficient linear time construction of suffix arrays. J. Disc. Algor. 3, 2-4, 143-156.
11. LARSSON, N. J. AND SADAKANE, K. 1999. faster suffix sorting. Tech. rep. LU-CS-TR:99-214
12. LUNDFD6/(NFCS-3140)/1-20/(1999). Department of Computer Science, Lund University, Sweden.
13. MANBER, U. AND MYERS, G. 1993. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22, 5, 935-948.
14. MANISCALCO, M. A. AND PUGLISI, S. J. 2006. Faster lightweight suffix array construction. In Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms. 16-29.
15. MANZINI, G. AND FERRAGINA, P. 2004. Engineering a lightweight suffix array construction algorithm. Algorithmica 40, 1, 33-50.
16. NONG, G., ZHANG, S., AND CHAN, W. H. 2011. Two efficient algorithms for linear time suffix array construction. IEEE Trans. Comput. 60, 10, 1471-1484.
17. OKANOHARA, D. AND SADAKANE, K. 2009. A linear-Time burrows-wheeler transform using induced sorting. In Proceedings of the 16th International Symposium on string Processing and Information Retrieval (SPIRE'09). Lecture Notes in Computer Science, vol. 5721, Spriger Verlag, Berlin Heidelberg, 90-101.
18. PUGLISI, S. J., SMYTH, W. F., AND TURPIN, A. H. 2007. A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39, 2, 1-31.
19. SADAKANE, K. 1998. A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation. In Proceedings of the Data Comprission Conference (DCC'98). 129-38.
20. SCHüRMANN, K. B. AND STOYE, J. 2005. An incomplex algorithm for fast suffix array construction. In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments and the 2nd Workshop on Analytic Algorithms and Combinations (ALENEX/ANALCO'05). 77-85.