{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:10:47Z","timestamp":1740373847383,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283126"},{"type":"electronic","value":"9783540318309"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539506_136","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:15:58Z","timestamp":1279721758000},"page":"1102-1107","source":"Crossref","is-referenced-by-count":0,"title":["Time and Space Efficient Search for Small Alphabets with Suffix Arrays"],"prefix":"10.1007","author":[{"given":"Jeong Seop","family":"Sim","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"136_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45735-6_4","volume-title":"String Processing and Information Retrieval","author":"M.I. Abouelhoda","year":"2002","unstructured":"Abouelhoda, M.I., Ohlebusch, E., Kurtz, S.: Optimal exact string matching based on suffix arrays. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 31\u201343. Springer, Heidelberg (2002)"},{"key":"136_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44888-8_5","volume-title":"Combinatorial Pattern Matching","author":"S. Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Fast lightweight suffix array construction and checking. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 55\u201369. Springer, Heidelberg (2003)"},{"key":"136_CR3","unstructured":"Choi, Y.W., Sim, J.S., Park, K.: Time and space efficinet search with suffix arrays. Journal of Korea Information Science Society (accepted)"},{"key":"136_CR4","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"136_CR5","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. JACM\u00a047, 987\u20131011 (2000)","journal-title":"JACM"},{"key":"136_CR6","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390\u2013398 (2001)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"136_CR7","first-page":"66","volume-title":"Information Retrieval: Data Structures & Algorithms","author":"G. Gonnet","year":"1992","unstructured":"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\u201382. Prentice Hall, Englewood Cliffs (1992)"},{"key":"136_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge Univ. Press, Cambridge (1997)"},{"key":"136_CR9","unstructured":"D. Gusfield: An Increment-by-one approach to suffix arrays and trees (1990) (manuscript)"},{"key":"136_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jcss.1997.1496","volume":"55","author":"R. Hariharan","year":"1997","unstructured":"Hariharan, R.: Optimal parallel suffix tree construction. J. Comput. Syst. Sci.\u00a055, 44\u201369 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"136_CR11","unstructured":"Hon, W., Sadakane, K., Sung, W.: Breaking a time-and-space barrier in constructing full-text indices. In: FOCS (2003) (accepted)"},{"key":"136_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"New Horizons in Information Management","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: James, A., Younas, M., Lings, B. (eds.) BNCOD 2003. LNCS, vol.\u00a02712, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"136_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jda.2004.08.019","volume":"3\/2-4","author":"D. Kim","year":"2005","unstructured":"Kim, D., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. Journal of Discrete Algorithms\u00a03\/2-4, 126\u2013142 (2005)","journal-title":"Journal of Discrete Algorithms"},{"key":"136_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"key":"136_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput.\u00a022, 935\u2013938 (1993)","journal-title":"SIAM J. Comput."},{"key":"136_CR16","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. JACM\u00a023, 262\u2013272 (1976)","journal-title":"JACM"},{"key":"136_CR17","unstructured":"Sadakane, K.: Succinct representation of lcp information and improvement in the compressed suffix arrays. In: SODA, pp. 225\u2013232 (2002)"},{"key":"136_CR18","unstructured":"Sim, J.S., Kim, D.K., Park, H., Park, K.: Linear-time search in suffix arrays. Journal of Korea Information Science Society (accepted)"},{"key":"136_CR19","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th IEEE Symp. Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Fuzzy Systems and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539506_136.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:56:05Z","timestamp":1740290165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539506_136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283126","9783540318309"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11539506_136","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}