References
- D. Gusfield, “Algorithms on Strings, Trees, and Sequences,” Computer Science and Computational Biology, CamBridge University Press, 1997.
- Z. M. Kedem. G. M. Landau, K. V. Palem, “Parallel suffix-prefix-Matching Algorithm and Applications,” SIAM Journal on Computing, Vol.25, No.5, pp.998-1023, 1996. https://doi.org/10.1137/S0097539792190157
- P. Green, D. Lipman, D. Hillier, R. Waterston, D. States, J. M. Claverie. “Ancient conserved regions in new gene sequences and the protein databases,” Science, Vol.259, pp.1711-1716, 1993. https://doi.org/10.1126/science.8456298
- E. M. McCrieght, “A Space-Economical Suffix Tree Construction Algorithm,” Journal of ther ACM, Vol.23, pp.262-272, 1976. https://doi.org/10.1145/321941.321946
- E. Ukkonen, “On-line construction of suffix trees,” Algorithmica, Vol.14, pp.249-260, 1995. https://doi.org/10.1007/BF01206331
- U. Manber, G. Myers, “Suffix arrays: a new method for on-line string searches,” SIAM Journal of Computing 22, pp.935-948, 1993. https://doi.org/10.1137/0222058
- P. Ko and S. Aluru, “Space efficient linear time construction of suffix arrays,” In Proc. of the 14th Annual Symposium on Combinatorial Pattern Matching, Vol.2676, pp.200-210, 2003. https://doi.org/10.1007/3-540-44888-8_15
- J. Karkkainen, P. Sanders, S. Burkhardt, “Linear work suffix array construction,” Journal of the ACM, Vol.53, pp.918-936, 2006. https://doi.org/10.1145/1217856.1217858
- D. K. Kim, J. S. Sim, H. Park, K. Park, “Constructing suffix arrays in linear time,” Journal of Discrete Algorithms, Vol.3, pp.126-142, 2005. https://doi.org/10.1016/j.jda.2004.08.019
- R. Grossi, J. S. Vitter, “Compressed suffix arrays and suffix trees with applications to text indexing and string matching,” In Proc. of the 32nd ACM Symposium on Theory of Computing, pp.397-406, 2000. https://doi.org/10.1145/335305.335351
- WK. Hon, K. Sadakane, WK. Sung, “Breaking a timeand-space barrier in constructing full-text indices,” In Proc. of the 44th Symposium on Foundations of Computer Science, pp.251-260, 2003. https://doi.org/10.1109/SFCS.2003.1238199
- M. Abouelhoda, E. Ohlebusch, S. Kurtz, “Optimal exact string matching based on suffix arrays,” In Proc. of the 9th International Symposium on String Processing and Information Retrieval. Vol.2476, pp.31-43, 2002. https://doi.org/10.1007/3-540-45735-6_4
- K. Sadakane, “Succinct representation of lcp information and improvement in the compressed suffix arrays,” In. proc. of the 13th ACM-SIAM Symposium on Discrete algorithms, pp.225-232, 2002.
- M. Abouelhoda, S. Kurtz, E. Ohlebusch, “Replacing Suffix Trees with Enhanced Suffix Arrays,” Journal of Discrete Algorithms, Vol.2, pp.53-86, 2004. https://doi.org/10.1016/S1570-8667(03)00065-0
- P. Ferragina, G. Manzini, “Opportunistic data structures with applications,” In Proc. of the 41st IEEE Symposium on Foundations of Computer Science, pp.390-398, 2000. https://doi.org/10.1109/SFCS.2000.892127
- 심정섭, 김동규, 박희진, 박근수, “접미사 배열을 이용한 선형시간 탐색”, 정보과학회 논문지: 시스템 및 이론, 제 32권 제 5호, pp.255-259, 2005.
- 최용욱, 심정섭, 박근수, “접미사 배열을 이용한 시간과 공간 효율적인 검색”, 정보과학회 논문지: 시스템 및 이론, 제 32권 제 5호, pp.260-267, 2005.