{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T19:02:24Z","timestamp":1772305344299,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0304-3975(03)00053-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"87-101","source":"Crossref","is-referenced-by-count":32,"title":["Truncated suffix trees and their application to data compression"],"prefix":"10.1016","volume":"304","author":[{"given":"Joong Chae","family":"Na","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Apostolico","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00053-7_BIB1","series-title":"Combinatorial Algorithms on Words","first-page":"85","article-title":"The myriad virtues of subword trees","author":"Apostolico","year":"1985"},{"issue":"12","key":"10.1016\/S0304-3975(03)00053-7_BIB2","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1109\/TCOM.1986.1096485","article-title":"Better OPM\/L text compression","volume":"COM-34","author":"Bell","year":"1986","journal-title":"IEEE Trans. Comm."},{"issue":"2\u20133","key":"10.1016\/S0304-3975(03)00053-7_BIB3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/comjnl\/40.2_and_3.76","article-title":"Semantically motivated improvements for PPM variants","volume":"40","author":"Bunton","year":"1997","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(03)00053-7_BIB4","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB5","doi-asserted-by":"crossref","unstructured":"M. Farach, Optimal suffix tree construction with large alphabets, Proc. of the 38th Annual Symp. on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, 1997, pp. 137\u2013143.","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"4","key":"10.1016\/S0304-3975(03)00053-7_BIB6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/63334.63341","article-title":"Data compression with finite windows","volume":"32","author":"Fiala","year":"1989","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(03)00053-7_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/PL00009177","article-title":"From Ukkonen to McCreight and Weiner","volume":"19","author":"Giegerich","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB8","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB9","doi-asserted-by":"crossref","unstructured":"D.S. Hirschberg, L.M. Stauffer, Parsing algorithms for dictionary compression on the PRAM, Proc. Data Compression Conf., IEEE Computer Society, Los Alamitos, 1994, pp. 136\u2013145.","DOI":"10.1109\/DCC.1994.305921"},{"issue":"3","key":"10.1016\/S0304-3975(03)00053-7_BIB10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S0129626497000310","article-title":"Dictionary compression on the PRAM","volume":"7","author":"Hirschberg","year":"1997","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0304-3975(03)00053-7_BIB11","unstructured":"J. Jiang, Implementing the PATRICIA data structure for compression algorithms with finite size dictionaries, Internat. Conf. on Data Transmission\u2014Advances in Modem and ISDN Technology and Applications, IEE. 1992, London, pp. 123\u2013127."},{"key":"10.1016\/S0304-3975(03)00053-7_BIB12","doi-asserted-by":"crossref","unstructured":"N.J. Larsson, Extended application of suffix trees to data compression, Proc. Data Compression Conf., IEEE Computer Society, Los Alamitos, 1996, pp. 190\u2013199.","DOI":"10.1109\/DCC.1996.488324"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB13","doi-asserted-by":"crossref","unstructured":"N.J. Larsson, The context trees of block sorting compression, Proc. Data Compression Conf., IEEE Computer Society, Los Alamitos, 1998, pp. 189\u2013198.","DOI":"10.1109\/DCC.1998.672147"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB14","doi-asserted-by":"crossref","unstructured":"Y. Matias, S. Muthukrishnan, S. Sahinalp, J. Ziv, Augmenting suffix trees with applications, Algorithms\u2014ESA \u201998 6th Annual European Symp. Proc., Springer, Berlin, 1998, pp. 67\u201378.","DOI":"10.1007\/3-540-68530-8_6"},{"issue":"2","key":"10.1016\/S0304-3975(03)00053-7_BIB15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB16","doi-asserted-by":"crossref","unstructured":"V.S. Miller, M.N. Wegman, Variations on a theme by Ziv and Lempel, IEEE Inter, Conf. on Comm. \u201988: Digital Technology-Spanning the Universe, IEEE, New York, 1988, pp. 390\u2013394.","DOI":"10.1109\/ICC.1988.13597"},{"issue":"1","key":"10.1016\/S0304-3975(03)00053-7_BIB17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","article-title":"Linear algorithm for data compression via string matching","volume":"28","author":"Rodeh","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB18","unstructured":"K. Sadakane, Text compression using recency rank with context and relation to context sorting, block sorting and PPM*, Proc. Compression and Complexity of SEQ. 1997, IEEE Computer Society, Los Alamitos, 1998, pp. 305\u2013319."},{"key":"10.1016\/S0304-3975(03)00053-7_BIB19","doi-asserted-by":"crossref","unstructured":"L.M. Stauffer, D.S. Hirschberg, PRAM algorithms for static dictionary compression, Proc. 8th Inter. Parallel Processing Symp., IEEE Computer Society, Los Alamitos, 1994, pp. 344\u2013348.","DOI":"10.1109\/IPPS.1994.288279"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB20","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1145\/322344.322346","article-title":"Data compression via textual substitution","volume":"29","author":"Storer","year":"1982","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(03)00053-7_BIB21","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(03)00053-7_BIB22","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms, 14th Annual Symp. on Switching Automata Theory, IEEE, New York, 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"issue":"6","key":"10.1016\/S0304-3975(03)00053-7_BIB23","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high-performance data compression","volume":"17","author":"Welch","year":"1984","journal-title":"IEEE Comput."},{"issue":"11","key":"10.1016\/S0304-3975(03)00053-7_BIB24","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1002\/(SICI)1097-024X(199611)26:11<1181::AID-SPE54>3.0.CO;2-X","article-title":"Data compression for PC software distribution","volume":"26","author":"Yu","year":"1996","journal-title":"Software-Practice Experience"},{"issue":"3","key":"10.1016\/S0304-3975(03)00053-7_BIB25","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inform. Theory IEEE"},{"issue":"5","key":"10.1016\/S0304-3975(03)00053-7_BIB26","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory, IEEE"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T14:31:37Z","timestamp":1734013897000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503000537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0304397503000537"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00053-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}