Linear-Time Search in Suffix Arrays |
Sin Jeong SeoP
(인하대학교 컴퓨터공학부)
Kim Dong Kyue (부산대학교 컴퓨터공학부) Park Heejin (한양대학교 컴퓨터공학부) Park Kunsoo (서울대학교 컴퓨터공학부) |
1 | P. Ko and S. Aluru, Space efficient linear time construction of suffix arrays, Symp. Combinatorial Pattern Matching, LNCS 2676, pp. 200-210, 2003 DOI ScienceOn |
2 | M. Farach, Optimal suffix tree construction with large alphabets, IEEE Symp. Found. Computer Science (1991), 137-143 DOI |
3 | M. Farach-Colton, P. Ferragina and S. Muthukrishnan, On the sorting-complexity of suffix tree construction, J. Assoc. Comput. Mach, vol. 47, pp. 987-1011, 2000 DOI ScienceOn |
4 | D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge Univ. Press, 1997 |
5 | D. Gusfield, An 'Increment-by-one' approach to suffix arrays and trees, manuscript, 1990 |
6 | S. Burkhardt and J. Karkkainen, Fast lightweight suffix array construction and checking, Symp. Combinatorial Pattern Matching, LNCS 2676, pp. 55-69, 2003 DOI ScienceOn |
7 | P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory, pp. 1-11, 1973 |
8 | U. Manber, G. Myers, 'Suffix arrays: a new method for on-line string searches,' SIAM J. Computing 22, pp. 935-948, 1993 DOI ScienceOn |
9 | 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, pp. 66-82. Prentice Hall, 1992 |
10 | M.I. Abouelhoda, E. Ohlebusch, and S. Kurtz, Optimal exact string matching based on suffix arrays, International Symposium on String Processing and Information Retrieval, LNCS 2476, 31-43, 2002 |
11 | P. Ferragina and G.. Manzini, Opportunistic data structures with applications, IEEE Symp. Found Computer Science, 390-398, 2001 DOI |
12 | K. Sadakane, Succinct representation of lcp information and improvement in the compressed suffixarrays, ACM-SIAM Symp. on Discrete Algorithms, pp. 225-232, 2002 |
13 | R. Hariharan, Optimal parallel suffix tree construction, J. Comput. Syst. Sci., vol. 55, pp. 44-69, 1997 DOI ScienceOn |
14 | W. Hon, K. Sadakane, and W. Sung, Breaking a time-and-space barrier in constructing full-text indices, Proc. IEEE Symp. Found Computer Science, pp.251-260, 2003 |
15 | J. Karkkainen and P. Sanders, Simple linear work suffix array construction, Int. Colloq. Automata Languages and Programming, LNCS 2719, pp. 943-955, 2003 |
16 | D. Kim, J.S. Sim, H. Park, and K. Park, Linear-time construction of suffix arrays, Symp. Combinatorial Pattern Matching, LNCS 2676, pp. 186-199, 2003 DOI ScienceOn |
17 | E. M. McCreight, 'A space-economical suffix tree construction algorithms,' J. ACM 23, pp. 262-272, 1976 DOI ScienceOn |