{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:27Z","timestamp":1725494427094},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_6","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T22:14:16Z","timestamp":1194560056000},"page":"67-78","source":"Crossref","is-referenced-by-count":22,"title":["Augmenting Suffix Trees, with Applications"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Matias","sequence":"first","affiliation":[]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[]},{"given":"S\u00fcleyman Cenk","family":"Sahinalp","sequence":"additional","affiliation":[]},{"given":"Jacob","family":"Ziv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"6_CR1","unstructured":"T. Bell, T. Cleary, and I. Witten. Text Compression. Academic Press, 1990."},{"key":"6_CR2","unstructured":"G. S. Brodal. Finger search trees with constant insertion time. In ACM-SIAM Symposium on Discrete Algorithms, 1998."},{"key":"6_CR3","unstructured":"M. Burrows and D. J. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, DEC SRC, 1994."},{"key":"6_CR4","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford Press, 1994."},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J. G. Cleary","year":"1984","unstructured":"J. G. Cleary and I. H. Witten. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications, 32(4):396\u2013402, 1984.","journal-title":"IEEE Transactions on Communications"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"D. M. Gusfield. Algorithms on Strings, Trees, and Sequences. Addison Wesley, 1998.","DOI":"10.1017\/CBO9780511574931"},{"key":"6_CR7","unstructured":"J. Hui. Color set size problem with applications to string matching. In Combinatorial Pattern Matching, 1992."},{"key":"6_CR8","unstructured":"Y. Hershkovits and J. Ziv. On sliding window universal data compression with limited memory. In Information Theory symposium, pages 17\u201322, September 1995."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/18.650988","volume":"44","author":"Y. Hershkovits","year":"1998","unstructured":"Y. Hershkovits and J. Ziv. On sliding window universal data compression with limited memory. IEEE Trans. on Information Theory, 44:66\u201378, January 1998.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 23(2):262\u2013272, April 1976.","journal-title":"Journal of the ACM"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1981","unstructured":"M. Rodeh, V. Pratt, and S. Even. Linear algorithm for data compression via string matching. Journal of the ACM, 28(1):16\u201324, January 1981.","journal-title":"Journal of the ACM"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On finding lowest common ancestors:simplification and parallelization. SIAM Journal of Computing, 17:1253\u20131262, 1988.","journal-title":"SIAM Journal of Computing"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"T.A. Welch. A technique for high-performance data compression. IEEE Computer, pages 8\u201319, January 1984.","DOI":"10.1109\/MC.1984.1659158"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/18.382011","volume":"41","author":"M. J. Weinberger","year":"1995","unstructured":"M. J. Weinberger, J. J. Rissanen, and M. Feder. A universal finite memory source. IEEE Transactions on Information Theory, 41(3):643\u2013652, 1995.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"H. Yokoo. An adaptive data compression method based on context sorting. In IEEE Data Compression Conference, 1996.","DOI":"10.1109\/DCC.1996.488321"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(3):337\u2013343, May 1977.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT-24","author":"J. Ziv","year":"1978","unstructured":"J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, IT-24(5):530\u2013536, September 1978.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:28:27Z","timestamp":1556958507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}