{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:21:33Z","timestamp":1741152093904,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_38","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"390-403","source":"Crossref","is-referenced-by-count":2,"title":["Dictionary-Symbolwise Flexible Parsing"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Laura","family":"Giambruno","sequence":"additional","affiliation":[]},{"given":"Alessio","family":"Langiu","sequence":"additional","affiliation":[]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"38_CR1","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1145\/179812.179892","volume":"41","author":"T.C. Bell","year":"1994","unstructured":"Bell, T.C., Witten, I.H.: The relationship between greedy parsing and symbolwise text compression. J. ACM\u00a041(4), 708\u2013724 (1994)","journal-title":"J. ACM"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Cohn, M., Khazan, R.: Parsing with prefix and suffix dictionaries. In: Data Compression Conference, pp. 180\u2013189 (1996)","DOI":"10.1109\/DCC.1996.488323"},{"key":"38_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1137\/1.9781611973068.84","volume-title":"Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2009","author":"P. Ferragina","year":"2009","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of lempel-ziv compression. In: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 768\u2013777. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"38_CR5","unstructured":"Gzip\u2019s Home Page, http:\/\/www.gzip.org"},{"key":"38_CR6","first-page":"155","volume-title":"Optimal parsing of strings","author":"A. Hartman","year":"1985","unstructured":"Hartman, A., Rodeh, M.: Optimal parsing of strings, pp. 155\u2013167. Springer, Heidelberg (1985)"},{"key":"38_CR7","unstructured":"Horspool, R.N.: The effect of non-greedy parsing in ziv-lempel compression methods. In: Data Compression Conference (1995)"},{"issue":"3","key":"38_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1093\/comjnl\/32.3.228","volume":"32","author":"J. Katajainen","year":"1989","unstructured":"Katajainen, J., Raita, T.: An approximation algorithm for space-optimal encoding of a text. Comput. J.\u00a032(3), 228\u2013237 (1989)","journal-title":"Comput. J."},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/128749.128751","volume":"39","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Raita, T.: An analysis of the longest match and the greedy heuristics in text encoding. J. ACM\u00a039(2), 281\u2013294 (1992)","journal-title":"J. ACM"},{"key":"38_CR10","unstructured":"Katz, P.: Pkzip archiving tool (1989), http:\/\/en.wikipedia.org\/wiki\/pkzip"},{"issue":"11","key":"38_CR11","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1049\/el:19980817","volume":"34","author":"T.Y. Kim","year":"1998","unstructured":"Kim, T.Y., Kim, T.: On-line optimal parsing in dictionary-based coding adaptive. Electronic Letters\u00a034(11), 1071\u20131072 (1998)","journal-title":"Electronic Letters"},{"issue":"2\/3","key":"38_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/comjnl\/40.2_and_3.117","volume":"40","author":"S.T. Klein","year":"1997","unstructured":"Klein, S.T.: Efficient optimal recompression. Comput. J.\u00a040(2\/3), 117\u2013126 (1997)","journal-title":"Comput. J."},{"key":"38_CR13","unstructured":"Mahoney, M.: Large text compression benchmark, http:\/\/mattmahoney.net\/text\/text.html"},{"key":"38_CR14","unstructured":"Martelock, C.: Rzm order-1 rolz compressor (April 2008), http:\/\/encode.ru\/forums\/index.php?action=vthread&forum=1&topic=647"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/945394.945404","volume":"6","author":"Y. Matias","year":"2001","unstructured":"Matias, Y., Rajpoot, N., Shainalp, S.C.: The effect of flexible parsing for dynamic dictionary-based data compression. ACM Journal of Experimental Algorithms\u00a06, 10 (2001)","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Matias, Y., Shainalp, S.C.: On the optimality of parsing in dynamic dictionary based data compression. In: SODA, pp. 943\u2013944 (1999)","DOI":"10.1109\/DCC.1999.755673"},{"key":"38_CR17","unstructured":"Della Penna, G., Langiu, A., Mignosi, F., Ulisse, A.: Optimal parsing in dictionary-symbolwise data compression schemes (2006), http:\/\/www.di.univaq.it\/mignosi\/ulicompressor.php"},{"issue":"9-10","key":"38_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0271(74)90069-2","volume":"10","author":"E.J. Schuegraf","year":"1974","unstructured":"Schuegraf, E.J., Heaps, H.S.: A comparison of algorithms for data base compression by use of fragments as language elements. Information Storage and Retrieval\u00a010(9-10), 309\u2013319 (1974)","journal-title":"Information Storage and Retrieval"},{"issue":"4","key":"38_CR19","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"J.A. Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textural substitution. J. ACM\u00a029(4), 928\u2013951 (1982)","journal-title":"J. ACM"},{"issue":"3","key":"38_CR20","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/361972.361982","volume":"16","author":"R.A. Wagner","year":"1973","unstructured":"Wagner, R.A.: Common phrases and minimum-space text storage. ACM Commun.\u00a016(3), 148\u2013152 (1973)","journal-title":"ACM Commun."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T06:36:35Z","timestamp":1741070195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}