{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:00:26Z","timestamp":1649095226169},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540438625","type":"print"},{"value":"9783540454526","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_3","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T21:55:29Z","timestamp":1179266129000},"page":"20-31","source":"Crossref","is-referenced-by-count":7,"title":["Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Rytter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"3_CR1","unstructured":"A. Apostolico, S. Leonardi, Some theory and practice of greedy off-line textual substitution, DCC 1998, pp. 119\u2013128"},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-63220-4_48","volume-title":"Proceedings of the 8thAnnual Symposium on Combinatorial Pattern Matching","author":"P. Berman","year":"1997","unstructured":"P. Berman, M. Karpinski, L. L. Larmore, W. Plandowski, and W. W. Rytter, On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching LNCS 1264, Edited by A. Apostolico and J. Hein, (1997), pp. 40\u201351. Full version to appear in JCSS"},{"key":"3_CR3","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York (1994)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"M. Farach and M. Thorup, String matching in Lempel-Ziv compressed strings, Proceedings of the 27th Annual Symposium on the Theory of Computing (1995), pp. 703\u2013712","DOI":"10.1145\/225058.225288"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"L. Gcasieniec, M. Karpinski, W. Plandowski and W. Rytter, Efficient Algorithms for Lempel-Ziv Encoding, Proceedings of the 5th Scandinavian Workshop on Algorithm Theory. Springer-Verlag (1996)","DOI":"10.1007\/3-540-61422-2_148"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Martin Farach, \u201cOptimal suffix tree construction with large alphabets\u201d, FOCS 1997","DOI":"10.1109\/SFCS.1997.646102"},{"key":"3_CR7","unstructured":"M. Hirao, A. Shinohara, M. Takeda, S. Arikawa, Faster fully compressed pattern matching algorithm for balanced straight-line programs\u201d, Proc. of 7th International Symposium on String Processing and Information Retrieval (SPIRE2000), pp. 132\u2013138. IEEE Computer Society, September 2000"},{"issue":"2","key":"3_CR8","first-page":"172","volume":"4","author":"M. Karpinski","year":"1997","unstructured":"M. Karpinski, W. Rytter and A. Shinohara, Pattern-matching for strings with short description, Nordic Journal of Computing, 4(2):172\u2013186, 1997","journal-title":"Nordic Journal of Computing"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"46","author":"J. Kieffer","year":"2000","unstructured":"J. Kieffer, E. Yang, Grammar-based codes: a new class of universal lossless source codes, IEEE Trans. on Inf. Theory 46 (2000) pp. 737\u2013754","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"3_CR10","unstructured":"D. Knuth, The Art of Computing, Vol. III Second edition. Addison-Wesley (1998), page. 474"},{"key":"3_CR11","unstructured":"J. K. Lanctot, Ming Li, En-hui Yang, Estimating DNA Sequence Entropy, SODA 2000"},{"key":"3_CR12","unstructured":"E. Lehman, A. Shelat, Approximation algorithms for grammar-based compression, SODA 2002"},{"key":"3_CR13","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 (1977), pp. 337\u2013343","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR14","first-page":"187","volume":"1","author":"M. Miyazaki","year":"2000","unstructured":"M. Miyazaki, A. Shinohara, M. Takeda, An improved pattern-matching algorithm for strings in terms of straight-line programs, Journal of Discrete Algorithms, Vol. 1, pp. 187\u2013204, 2000","journal-title":"Journal of Discrete Algorithms"},{"key":"3_CR15","unstructured":"C. Nevill-Manning, Inferring sequential structure, PhD thesis, University of Waikato, 1996"},{"issue":"11","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/5.892712","volume":"88","author":"W. Rytter","year":"2000","unstructured":"W. Rytter, Compressed and fully compressed pattern-matching in one and two-dimensions, Proceedings of IEEE, November 2000, Volume 88, Number 11, pp. 1769\u20131778","journal-title":"Proceedings of IEEE"}],"container-title":["Combinatorial Pattern Matching","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:52:52Z","timestamp":1556398372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":16,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45452-7_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2002]]}}}