{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:45Z","timestamp":1725561405993},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_26","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"240-249","source":"Crossref","is-referenced-by-count":9,"title":["Constructing Compressed Suffix Arrays with Large Alphabets"],"prefix":"10.1007","author":[{"given":"Wing-Kai","family":"Hon","sequence":"first","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, California (1994)"},{"key":"26_CR2","unstructured":"Clark, D.R., Munro, J.I.: Efficient Suffix Trees on Secondary Storage. In: Proc. ACM-SIAM SODA, pp. 383\u2013391 (1996)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal Suffix Tree Construction with Large Alphabets. In: Proc. IEEE FOCS, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"26_CR4","unstructured":"Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: Proc. ACM-SIAM SODA, pp. 269\u2013278 (2001)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Ferragine, P., Manzini, G.: Opportunistic Data Structures with Applications. In: Proc. IEEE FOCS, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"26_CR6","unstructured":"Graff, D., Chen, K.: Chinese Gigaword (2003), http:\/\/www.ldc.upenn.edu\/Catalog\/CatalogEntry.jsp?catalogId=LDC2003T09"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. In: Proc. ACM STOC, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. Manuscript (2001)","DOI":"10.1145\/335305.335351"},{"key":"26_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5539-1","volume-title":"Information Retrieval: Algorithms and Heuristics","author":"D.A. Grossman","year":"1998","unstructured":"Grossman, D.A., Frieder, O.: Information Retrieval: Algorithms and Heuristics. Kluwer Academic Publishers, Boston (1998)"},{"key":"26_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"26_CR11","unstructured":"Hon, W.K., Sadakane, K., Sung, W.K.: Breaking a Time-and-Sapce Barrier in Constructing Full-Text Indices. In: Proc. IEEE FOCS (2003) (to appear)"},{"key":"26_CR12","unstructured":"Hunt, E., Atkinson, M.P., Irving, R.W.: A database index to large biological sequences. In: Proc. VLDB, pp. 410\u2013421 (2000)"},{"key":"26_CR13","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":"26_CR14","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the Space Requirement of Suffix Trees. Software Practice and Experiences\u00a029, 1149\u20131171 (1999)","journal-title":"Software Practice and Experiences"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-45655-4_43","volume-title":"Computing and Combinatorics","author":"T.W. Lam","year":"2002","unstructured":"Lam, T.W., Sadakane, K., Sung, W.K., Yiu, S.M.: A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 401\u2013410. Springer, Heidelberg (2002)"},{"key":"26_CR16","unstructured":"Larsson, J., Sadakane, K.: Faster Suffix Sorting. Technical Report Technical Report LU-CS-TR:99-214, LUNDFD6\/(NFCS-3140)\/1-43\/(1999), Lund University (1999)"},{"issue":"5","key":"26_CR17","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 Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"26_CR18","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An Analysis of the Burrows-Wheeler Transform. Journal of the ACM\u00a048(3), 407\u2013430 (2001)","journal-title":"Journal of the ACM"},{"issue":"2","key":"26_CR19","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. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"26_CR20","unstructured":"Ong, T.H., Chen, H.: Updateable PAT-Tree Approach to Chinese Key Phrase Extraction using Mutual Information: A Linguistic Foundation for Knowledge Management. In: Proceedings of Asian Digital Library Conference (1999)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Rice, R.F.: Some practical universal noiseless coding techniques. Technical Report JPL-79-22, Jet Propulsion Laboratory, Pasadena, California (1979)","DOI":"10.1117\/12.958253"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Sadakane, K.: New Text Indexing Functionalities of the Compressed Suffix Arrays. Journal of Algorithms (in press)","DOI":"10.1016\/S0196-6774(03)00087-7"},{"key":"26_CR23","unstructured":"Seward, J.: The bzip2 and libbzip2 official home page (1996), http:\/\/sources.redhat.com\/bzip2\/"},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"S. Shimozono","year":"2000","unstructured":"Shimozono, S., Arimura, H., Arikawa, S.: Efficient Discovery of Optimal Word Association Patterns in Large Text Databases. New Generation Computing\u00a018, 49\u201360 (2000)","journal-title":"New Generation Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:56:05Z","timestamp":1559346965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}