{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:31:20Z","timestamp":1747809080329},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_2","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"12-25","source":"Crossref","is-referenced-by-count":3,"title":["Quasi-distinct Parsing and Optimal Compression Methods"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonatan","family":"Aumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Roshko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"http:\/\/www.cs.fit.edu\/~mmahoney\/compression\/textdata.html"},{"issue":"1","key":"2_CR2","first-page":"1","volume":"84","author":"A. Amir","year":"2008","unstructured":"Amir, A., Levy, A., Reuveni, L.: The practical efficiency of convolutions in pattern matching algorithms. Fundamenta Informaticae\u00a084(1), 1\u201315 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR3","volume-title":"Text compression","author":"T.C. Bell","year":"1990","unstructured":"Bell, T.C., Cleary, J.G., Witten, I.H.: Text compression. Prentice-Hall, Englewood Cliffs (1990)"},{"key":"2_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm., Tech. Rep. 124, Digital Equipment Corporation, Palo Alto, Calif. (1994)"},{"key":"2_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley Interscience, Hoboken (1991)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"IT-46","author":"J.C. Kieffer","year":"2000","unstructured":"Kieffer, J.C., Yang, E.-H.: Grammar based codes: a new class of universal lossless source codes. IEEE Transactions on Information Theory\u00a0IT-46(3), 737\u2013754 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"IT-22","author":"A. Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions on Information Theory\u00a0IT-22, 75\u201381 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Louchard, G., Szpankowski, W.: Generalized lempel-ziv parsing scheme and its preliminary analysis of the average profile. In: Data Compression Conference (DCC), pp. 262\u2013271 (1995)","DOI":"10.1109\/DCC.1995.515516"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM (JACM)\u00a048(3), 407\u2013430 (2001)","journal-title":"Journal of the ACM (JACM)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Nevill-Manning, C., Witten, I., Maulsby, D.: Compression by induction of hierarchical grammars. In: Proceedings of Data Compression Conference (DCC), pp. 244\u2013253 (1994)","DOI":"10.1109\/DCC.1994.305932"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/18.45281","volume":"IT-35","author":"A.D. Wyner","year":"1989","unstructured":"Wyner, A.D., Ziv, J.: Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression. IEEE Transactions on Information Theory\u00a0IT-35(6), 1250\u20131258 (1989)","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1109\/5.286191","volume":"82","author":"A.D. Wyner","year":"1994","unstructured":"Wyner, A.D., Ziv, J.: The sliding-window lempel-ziv algorithm is asymptotically optimal. Proceedings of the IEEE\u00a082, 872\u2013877 (1994)","journal-title":"Proceedings of the IEEE"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TIT.1978.1055911","volume":"IT-24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J.: Coding theorems for individual sequences. IEEE Transactions on Information Theory\u00a0IT-24(4), 405\u2013412 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a0IT-23(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2_CR16","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT-24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory\u00a0IT-24(5), 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T16:12:45Z","timestamp":1552061565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}