Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays

Algorithmica (New York)

Volumn 52, Issue 3, 2008, Pages 350-377

  Kim, Dong Kyue ^a   Kim, Minhwan ^b   Park, Heejin ^a  

^a Hanyang University   (South Korea)

^b Pusan National University   (South Korea)

Author keywords

Index data structures; String algorithms; Suffix arrays; Suffix trees

Indexed keywords

EFFICIENT ALGORITHMS; INDEX DATA STRUCTURES; PATTERN SEARCHES; PATTERN SEARCHING; PRACTICAL IMPLEMENTATIONS; STRING ALGORITHMS; STRING PROCESSING; SUFFIX ARRAYS; SUFFIX LINKS; SUFFIX TREES; TEXT INDICES;

ALGORITHMS; FILE ORGANIZATION; INDEXING (OF INFORMATION); LINEARIZATION; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

DATA STRUCTURES;

EID: 55149087199     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9061-2     Document Type: Article

References (36)

1. M.I. Abouelhoda S. Kurtz E. Ohlebusch 2004 Replacing suffix trees with enhanced suffix arrays J. Discrete Algorithms 2 53 86
2. Abouelhoda, M., Ohlebusch, E., Kurtz, S.: Optimal exact string matching based on suffix arrays. In: Symposium on String Processing and Information Retrieval, pp. 31-43 (2002)
3. Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)
4. Burkhardt, S., Kärkkäinen, J.: Fast lightweight suffix array construction and checking. In: Symposium on Combinatorial Pattern Matching, pp. 55-69 (2003)
5. Chen, M.T., Seiferas, J.: Efficient and elegant subword tree construction. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series F: Computer and System Sciences, pp. 97-107. Springer, Berlin (1985)
6. Clark, D., Munro, I.: Efficient suffix trees on secondary storage. In: SODA, pp. 383-391 (1996)
7. L. Colussi A. Col 1996 A time and space efficient data structure for string searching on large texts IPL 58 5 217 222
8. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
9. A. Crauser P. Ferragina 2002 A theoretical and experimental study on the construction of suffix arrays in external memory Algorithmica 32 1 35
10. Dementiev, R., Kärkkäinen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. In: Workshop on Algorithm Engineering and Experiments (2005)
11. Farach, M.: Optimal suffix tree construction with large alphabets. In: IEEE Symposium on Foundations of Computer Science, pp. 137-143 (1997)
12. M. Farach-Colton P. Ferragina S. Muthukrishnan 2000 On the sorting-complexity of suffix tree construction J. Assoc. Comput. Mach. 47 987 1011
13. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: IEEE Symposium on Foundations of Computer Science, pp. 390-398 (2001)
14. R. Giegerich S. Kurtz 1995 A comparison of imperative and purely functional suffix tree construction Sci. Comput. Program. 25 187 218
15. R. Giegerich S. Kurtz 1997 From Ukkonen to McCreight and Weiner: a unifying view of linear-time suffix tree construction Algorithmica 19 331 353
16. Gonnet, G., Baeza-Yates, R., Snider, T.: New indices for text: Pat trees and pat arrays. In: Frakes, W.B., Baeza-Yates, R.A. (eds.) Information Retrieval: Data Structures & Algorithms, pp. 66-82. Prentice-Hall, Englewood Cliffs (1992)
17. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: ACM Symposium on Theory of Computing, pp. 397-406 (2000)
18. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
19. Hon, W.K., Sadakane, K., Sung, W.K.: Breaking a time-and-space barrier in constructing full-text indices. In: IEEE Symposium on Foundations of Computer Science, pp. 251-260 (2003)
20. Kärkkäinen, J.: Suffix cactus: a cross between suffix tree and suffix array. In: Symposium on Combinatorial Pattern Matching, pp. 191-204 (1995)
21. Kärkkäinen, J., Sanders, P.: Simpler linear work suffix array construction. In: International Colloqium on Automata Languages and Programming, pp. 943-955 (2003)
22. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Symposium on Combinatorial Pattern Matching, pp. 181-192 (2001)
23. Kim, D.K., Jo, J., Park, H.: A fast algorithm for constructing suffix arrays for fixed-size alphabets. In: Workshop on Efficient and Experimental Algorithms, pp. 301-314 (2004)
24. Kim, D.K., Park, K.: Linear-time construction of two-dimensional suffix trees. In: International Colloqium on Automata Languages and Programming, pp. 463-472 (1999)
25. Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Symposium on Combinatorial Pattern Matching, pp. 186-199 (2003)
26. Ko, P., Aluru, S.: Space-efficient linear time construction of suffix arrays. In: Symposium on Combinatorial Pattern Matching, pp. 200-210 (2003)
27. S. Kurtz 1999 Reducing the space requirement of suffix trees Softw. Pract. Experience 29 1149 1171
28. Larsson, N.J., Sadakane, K.: Faster suffix sorting. Technical report No. LU-CS-TR:99-214, Department of Computer Science, Lund University, Sweden (1999)
29. U. Manber G. Myers 1993 Suffix arrays: a new method for on-line string searches SIAM J. Comput. 22 935 938
30. G. Manzini P. Ferragina 2004 Engineering a lightweight suffix array construction algorithm Algorithmica 40 33 50
31. E.M. McCreight 1976 A space-economical suffix tree construction algorithm J. Assoc. Comput. Mach. 23 262 272
32. J.I. Munro V. Raman S.S. Rao 2001 Space efficient suffix trees J. Algorithms 39 205 222
33. Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. (2007, in press)
34. K. Schürmann J. Stoye 2007 An incomplex algorithm for fast suffix array construction Softw. Pract. Exp. 37 3 309 329
35. E. Ukkonen 1995 On-line construction of suffix trees Algorithmica 14 249 260
36. Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, pp. 1-11 (1973)