{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:13Z","timestamp":1763467993715},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_11","type":"book-chapter","created":{"date-parts":[[2010,10,21]],"date-time":"2010-10-21T17:26:45Z","timestamp":1287682005000},"page":"137-152","source":"Crossref","is-referenced-by-count":7,"title":["Linear-Time Off-Line Text Compression by Longest-First Substitution"],"prefix":"10.1007","author":[{"given":"Shunsuke","family":"Inenaga","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Funamoto","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"NATO Advanced Science Institutes, Series F","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithm on Words","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithm on Words. NATO Advanced Science Institutes, Series F, vol.\u00a012, pp. 85\u201396. Springer, Heidelberg (1985)"},{"issue":"11","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/5.892709","volume":"88","author":"A. Apostolico","year":"2000","unstructured":"Apostolico, A., Lonardi, S.: Off-line compression by greedy textual substitution. Proc. IEEE\u00a088(11), 1733\u20131744 (2000)","journal-title":"Proc. IEEE"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF01955046","volume":"15","author":"A. Apostolico","year":"1996","unstructured":"Apostolico, A., Preparata, F.P.: Data structures and algorithms for the string statistics problem. Algorithmica\u00a015, 481\u2013494 (1996)","journal-title":"Algorithmica"},{"key":"11_CR4","volume-title":"Text Compression","author":"T.C. Bell","year":"1990","unstructured":"Bell, T.C., Cleary, J.G., Witten, I.H.: Text Compression. Prentice Hall, New Jersey (1990)"},{"key":"11_CR5","first-page":"287","volume-title":"Proc. Data Compression Conference 1999 (DCC 1999)","author":"J. Bentley","year":"1999","unstructured":"Bentley, J., McIlroy, D.: Data compression using long common strings. In: Proc. Data Compression Conference 1999 (DCC 1999), pp. 287\u2013295. IEEE Computer Society, Los Alamitos (1999)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM\u00a034(3), 578\u2013595 (1987)","journal-title":"J. ACM"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/3-540-45465-9_62","volume-title":"Automata, Languages and Programming","author":"G.S. Br\u00f8dal","year":"2002","unstructured":"Br\u00f8dal, G.S., Lyngs\u00f8, R.B., \u00d6stlin, A., Pedersen, C.N.S.: Solving the string statistics problem in time $\\mathcal{O}(n\\log n)$ . In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 728\u2013739. Springer, Heidelberg (2002)"},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"11_CR9","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 University Press, New York (1997)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-48194-X_16","volume-title":"Combinatorial Pattern Matching","author":"S. Inenaga","year":"2001","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 169\u2013180. Springer, Heidelberg (2001)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4inen","year":"1996","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Sparse suffix trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 219\u2013230. Springer, Heidelberg (1996)"},{"issue":"11","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"N.J. Larsson","year":"2000","unstructured":"Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. Proc. IEEE\u00a088(11), 1722\u20131732 (2000)","journal-title":"Proc. IEEE"},{"issue":"2","key":"11_CR13","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. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C.G. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artificial Intelligence Research\u00a07, 67\u201382 (1997)","journal-title":"J. Artificial Intelligence Research"},{"key":"11_CR15","first-page":"179","volume-title":"Proc. Data Compression Conference 1998 (DCC 1998)","author":"C.G. Nevill-Manning","year":"1998","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Phrase hierarchy inference and compression in bounded space. In: Proc. Data Compression Conference 1998 (DCC 1998), pp. 179\u2013188. IEEE Computer Society, Los Alamitos (1998)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Online and offline heuristics for inferring hierarchies of repetitions in sequences 88(11), 1745\u20131755 (2000)","DOI":"10.1109\/5.892710"},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1111\/j.2044-8295.1975.tb01442.x","volume":"66","author":"J.G. Wolff","year":"1975","unstructured":"Wolff, J.G.: An algorithm for the segmentation for an artificial language analogue. Britich Journal of Psychology\u00a066, 79\u201390 (1975)","journal-title":"Britich Journal of Psychology"},{"issue":"5","key":"11_CR20","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-rate coding. IEEE Trans Information Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Trans Information 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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T18:48:44Z","timestamp":1559760524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39984-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201779","9783540399841"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39984-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}