Time and space efficient search for small alphabets with suffix arrays

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3613, Issue PART I, 2005, Pages 1102-1107

  Sim, Jeong Seop ^a  

^a Inha University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARRAYS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; INDEXING (OF INFORMATION); KNOWLEDGE ACQUISITION; MATHEMATICAL TRANSFORMATIONS; TREES (MATHEMATICS);

BURROWS-WHEELER TRANSFROM; LINEAR-TIME SEARCH ALGORITHMS; SUFFIX ARRAYS;

FUZZY SETS;

EID: 26944478547     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539506_136     Document Type: Conference Paper

References (19)

1. M.I. Abouelhoda, E. Ohlebusch, and S. Kurtz: Optimal exact string matching based on suffix arrays, International Symposium on String Processing and Information Retrieval (2002), LNCS 2476, 31-43.
2. S. Burkhardt and J. Kärkkäinen: Fast lightweight suffix array construction and checking, Symp. Combinatorial Pattern Matching (2003), LNCS 2676, 55-69.
3. Y.W. Choi, J.S. Sim, and K. Park: Time and space efficinet search with suffix arrays, Journal of Korea, Information Science Society, accepted.
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. P. Ferragina and G. Manzini: Opportunistic data structures with applications, IEEE Symp, Found. Computer Science (2001), 390-398.
7. 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, pages 66-82. Prentice Hall 1992.
8. D. Gusfield: Algorithms on Strings, Trees, and Sequences, Cambridge Univ. Press 1997.
9. D. Gusfield: An "Increment-by-one" approach to suffix arrays and trees, manuscript 1990.
10. R. Hariharan: Optimal parallel suffix tree construction, J. Comput. Syst. Sci. 55 (1997), 44-69.
11. W. Hon, K. Sadakane, and W. Sung: Breaking a time-and-space barrier in constructing full-text indices, IEEE Symp. Found. Computer Science (2003), accepted.
12. J. Kärkkäinen and P. Sanders: Simple linear work suffix array construction, Int. Colloq. Automata Languages and Programming (2003), LNCS 2719, 943-955.
13. D. Kim, J.S. Sim, H. Park, and K. Park: Linear-time construction of suffix arrays, Journal of Discrete Algorithms 3/2-4 (2005), 126-142.
14. P. Ko and S. Aluru: Space efficient linear time construction of suffix arrays, Symp. Combinatorial Pattern Matching (2003), LNCS 2676, 200-210.
15. U. Manber and G. Myers: Suffix arrays: A new method for on-line string searches, SIAM J. Comput. 22 (1993), 935-938.
16. E.M. McCreight: A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 23 (1976), 262-272.
17. K. Sadakane: Succinct representation of lcp information and improvement in the compressed suffix arrays, ACM-SIAM Symp. on Discrete Algorithms (2002), 225-232.
18. J.S. Sim, D.K. Kim, H. Park, and K. Park: Linear-time search in suffix arrays, Journal of Korea Information Science Society, accepted.
19. P. Weiner: Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory (1973), 1-11.