An efficient index data structure with the capabilities of suffix trees and suffix arrays for alphabets of non-negligible size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3246, Issue , 2004, Pages 138-149

  Kim, Dong Kyue ^a   Jeon, Jeong Eun ^a   Park, Heejin ^b  

^a Pusan National University   (South Korea)

^b Hanyang University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION TIME; FULL-TEXT INDEX; INDEX DATA STRUCTURES; PATTERN SEARCH; STRING PROCESSING; SUFFIX ARRAYS; SUFFIX-TREES;

ALGORITHMS; DATA STRUCTURES; FORESTRY; TREES (MATHEMATICS); INDEXING (OF INFORMATION); INFORMATION RETRIEVAL;

INDEXING (OF INFORMATION); TREES (MATHEMATICS);

COEFFICIENTS; DATA; INFORMATION RETRIEVAL; STRUCTURES;

EID: 84871042584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30213-1_22     Document Type: Conference Paper

References (17)

1. M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays, J. of Discrete Algorithms (2004), 53-86.
2. M. Abouelhoda, E. Ohlebusch, and S. Kurtz, Optimal exact string matching based on suffix arrays, Symp. on String Processing and Information Retrieval (2002), 31-43.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms (Second Edition), MIT Press (2001)
4. M. Farach, Optimal suffix tree construction with large alphabets, IEEE Symp. Found. Computer Science (1997), 137-143.
5. M. Farach-Colton, P. Ferragina and S. Muthukrishnan, On the sorting-complexity of suffix tree construction, J. Assoc. Comput. Mach. 47 (2000), 987-1011.
6. G. Gonnet, R. Baeza-Yates, and T. Snider, New indices for text: Pat trees and pat arrays. In W. B. Frakes and R. A. Baeza-Yates, editors, Information Retrieval: Data Structures & Algorithms, Prentice Hall (1992), 66-82.
7. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge Univ. Press 1997.
8. N. J. Larsson and K. Sadakane, Faster Suffix Sorting, Technical Report, number LU-CS-TR:99-214, Department of Computer Science, Lund University, Sweden, (1999).
9. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-time longestcommon-prefix computation in suffix arrays and its applications, Symp. Combinatorial Pattern Matching (2001), 181-192.
10. J. Kärkkäinen and P. Sanders, Simpler linear work suffix array construction, Int. Colloq. Automata Languages and Programming (2003), 943-955.
11. D. K. Kim, J. Jo, and H. Park, A fast algorithm for constructing suffix arrays for fixed-size alphabets, Workshop on Efficient and Experimental Algorithms (2004), 301-314.
12. D. K. Kim, J. S. Sim, H. Park and K. Park, Linear-time construction of suffix arrays, Symp. Combinatorial Pattern Matching (2003), 186-199.
13. P. Ko and S. Aluru, Space-efficient linear time construction of suffix arrays, Symp. Combinatorial Pattern Matching (2003), 200-210.
14. U. Manber and G. Myers, Suffix arrays: A new method for on-line string searches, SIAM J. Comput. 22 (1993), 935-938.
15. E.M. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 23 (1976), 262-272.
16. E. Ukkonen, On-line construction of suffix trees, Algorithmica 14 (1995), 249-260.
17. P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory (1973), 1-11.