{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:18Z","timestamp":1775281218714,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642163203","type":"print"},{"value":"9783642163210","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_17","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T10:51:32Z","timestamp":1286275892000},"page":"179-184","source":"Crossref","is-referenced-by-count":4,"title":["Training Parse Trees for Efficient VF Coding"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Uemura","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Yoshida","sequence":"additional","affiliation":[]},{"given":"Takuya","family":"Kida","sequence":"additional","affiliation":[]},{"given":"Tatsuya","family":"Asai","sequence":"additional","affiliation":[]},{"given":"Seishi","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Navarro, G., Esteller, M.F.: (s, c)-dense coding: An optimized compression code for natural language text databases. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 122\u2013136. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-39984-1_10"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-36618-0_33","volume-title":"Advances in Information Retrieval","author":"N.R. Brisaboa","year":"2003","unstructured":"Brisaboa, N.R., Iglesias, E.L., Navarro, G., Param\u00e1, J.R.: An efficient compression code for text databases. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol.\u00a02633, pp. 468\u2013481. Springer, Heidelberg (2003)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Kida, T.: Suffix tree based VF-coding for compressed pattern matching. In: Data Compression Conference 2009, p. 449. IEEE Computer Society, Los Alamitos (March 2009)","DOI":"10.1109\/DCC.2009.58"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-89097-3_6","volume-title":"String Processing and Information Retrieval","author":"S.T. Klein","year":"2008","unstructured":"Klein, S.T., Shapira, D.: Improved variable-to-fixed length codes. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 39\u201350. Springer, Heidelberg (2008)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-89097-3_5","volume-title":"String Processing and Information Retrieval","author":"S. Maruyama","year":"2008","unstructured":"Maruyama, S., Tanaka, Y., Sakamoto, H., Takeda, M.: Context-sensitive grammar transform: Compression and pattern matching. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 27\u201338. Springer, Heidelberg (2008)"},{"key":"17_CR6","first-page":"481","volume-title":"Data Compression Conference 1998","author":"S.A. Savari","year":"1998","unstructured":"Savari, S.A.: Variable-to-fixed length codes for predictable sources. In: Data Compression Conference 1998, pp. 481\u2013490. IEEE Computer Society, Los Alamitos (1998)"},{"key":"17_CR7","unstructured":"Tunstall, B.P.: Synthesis of noiseless compression codes. Ph.D. thesis, Georgia Inst. Technol., Atlanta, GA (1967)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"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-642-16321-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T03:13:29Z","timestamp":1559704409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}