{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:24:10Z","timestamp":1725567850088},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201779"},{"type":"electronic","value":"9783540399841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39984-1_9","type":"book-chapter","created":{"date-parts":[[2010,10,21]],"date-time":"2010-10-21T13:26:45Z","timestamp":1287667605000},"page":"108-121","source":"Crossref","is-referenced-by-count":3,"title":["Processing of Huffman Compressed Texts with a Super-Alphabet"],"prefix":"10.1007","author":[{"given":"Kimmo","family":"Fredriksson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"V. Aho","year":"1975","unstructured":"Aho, V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/DCC.1992.227453","volume-title":"Proceedings of 2nd IEEE Data Compression Conference (DCC 1992)","author":"A. Amir","year":"1992","unstructured":"Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Proceedings of 2nd IEEE Data Compression Conference (DCC 1992), pp. 279\u2013288. IEEE Computer Society Press, Los Alamitos (1992)"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/jcss.1996.0023","volume":"52","author":"A. Amir","year":"1996","unstructured":"Amir, A., Benson, G., Farach, M.: Let sleeping files lie: Pattern matching in Z-compressed files. J. Comput. Syst. Sci.\u00a052(2), 299\u2013307 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"10","key":"9_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-63307-3_57","volume-title":"Algorithms and Data Structures","author":"R.A. Baeza-Yates","year":"1997","unstructured":"Baeza-Yates, R.A., Navarro, G.: Multiple approximate string matching. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 174\u2013184. Springer, Heidelberg (1997)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/253495.342777","volume-title":"Proceedings of SIGIR 1985, 8th Annual International Conference of Research and Development in Information Retrieval","author":"Y. Choueka","year":"1985","unstructured":"Choueka, Y., Klein, S.T., Perl, Y.: Efficient variants of Huffman codes in highlevel languages. In: Proceedings of SIGIR 1985, 8th Annual International Conference of Research and Development in Information Retrieval, pp. 122\u2013130. ACM, New York (1985)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45735-6_5","volume-title":"String Processing and Information Retrieval","author":"K. Fredriksson","year":"2002","unstructured":"Fredriksson, K.: Faster string matching with super-alphabets. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 44\u201357. Springer, Heidelberg (2002)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1951","unstructured":"Huffman, D.A.: A method for the construction of minimum redundancy codes. Proc. I.R.E.\u00a040, 1098\u20131101 (1951)","journal-title":"Proc. I.R.E."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/DCC.2001.917176","volume-title":"Proceedings of 11th IEEE Data Compression Conference (DCC 2001)","author":"S.T. Klein","year":"2001","unstructured":"Klein, S.T., Shapira, D.: Pattern matching in Huffman encoded texts. In: Proceedings of 11th IEEE Data Compression Conference (DCC 2001), pp. 449\u2013458. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44888-8_16","volume-title":"Combinatorial Pattern Matching","author":"J. Kyt\u00f6joki","year":"2003","unstructured":"Kyt\u00f6joki, J., Salmela, L., Tarhio, J.: Tuning string matching for huge pattern sets. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 211\u2013224. Springer, Heidelberg (2003)"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. Moura","year":"2000","unstructured":"Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Transactions on Information Systems\u00a018(2), 113\u2013139 (2000)","journal-title":"ACM Transactions on Information Systems"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/DCC.2001.917177","volume-title":"Proceedings of 11th IEEE Data Compression Conference (DCC 2001)","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Kida, T., Takeda, M., Shinohara, A., Arikawa, S.: Faster approximate string matching over compressed text. In: Proceedings of 11th IEEE Data Compression Conference (DCC 2001), pp. 459\u2013468. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45735-6_16","volume-title":"String Processing and Information Retrieval","author":"M. Takeda","year":"2002","unstructured":"Takeda, M., Miyamoto, S., Kida, T., Shinohara, A., Fukamachi, S., Shinohara, T., Arikawa, S.: Processing text files as is: Pattern matching over compressed texts, multi-byte character texts, and semi-structured texts. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 170\u2013186. Springer, Heidelberg (2002)"},{"issue":"3","key":"9_CR14","first-page":"370","volume":"42","author":"M. Takeda","year":"2001","unstructured":"Takeda, M., Shibata, Y., Matsumoto, T., Kida, T., Shinohara, A., Fukamachi, S., Shinohara, T., Arikawa, S.: Speeding up string pattern matching by text compression: The dawn of a new era. Transactions of Information Processing Society of Japan\u00a042(3), 370\u2013384 (2001)","journal-title":"Transactions of Information Processing Society of Japan"},{"issue":"10","key":"9_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching allowing errors. Commun. ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Commun. ACM"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory\u00a023, 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable length coding. IEEE Trans. Inf. Theory\u00a024, 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39984-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T16:27:59Z","timestamp":1548433679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39984-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201779","9783540399841"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39984-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}