{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:25:32Z","timestamp":1767338732105,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592110"},{"type":"electronic","value":"9783030592127"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59212-7_17","type":"book-chapter","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:05:34Z","timestamp":1600250734000},"page":"232-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Comparison of Empirical Tree Entropies"],"prefix":"10.1007","author":[{"given":"Danny","family":"Hucke","sequence":"first","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]},{"given":"Louisa Seelbach","family":"Benkner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"key":"17_CR1","unstructured":"Bille, P., Gawrychowski, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Top tree compression of tries. In: Proceedings of the ISAAC 2019, LIPIcs, vol. 149, pp. 4:1\u20134:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ic.2014.12.012","volume":"243","author":"P Bille","year":"2015","unstructured":"Bille, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166\u2013177 (2015)","journal-title":"Inf. Comput."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1007\/s00224-014-9544-x","volume":"57","author":"M Bousquet-M\u00e9lou","year":"2015","unstructured":"Bousquet-M\u00e9lou, M., Lohrey, M., Maneth, S., Noeth, E.: XML compression via DAGs. Theory Comput. Syst. 57(4), 1322\u20131371 (2015)","journal-title":"Theory Comput. Syst."},{"key":"17_CR4","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Hoboken (2006)","edition":"2"},{"key":"17_CR5","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proceeding of the FOCS 2005, pp. 184\u2013196. IEEE Computer Society (2005)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1613676.1613680","volume":"57","author":"P Ferragina","year":"2009","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57(1), 4:1\u20134:33 (2009)","journal-title":"J. ACM"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BFb0032034","volume-title":"Automata, Languages and Programming","author":"P Flajolet","year":"1990","unstructured":"Flajolet, P., Sipala, P., Steyaert, J.-M.: Analytic variations on the common subexpression problem. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 220\u2013234. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032034"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ipl.2006.04.008","volume":"99","author":"T Gagie","year":"2006","unstructured":"Gagie, T.: Large alphabets and incompressibility. Inf. Process. Lett. 99(6), 246\u2013251 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"10","key":"17_CR9","doi-asserted-by":"publisher","first-page":"6399","DOI":"10.1109\/TIT.2019.2919829","volume":"65","author":"M Ganardi","year":"2019","unstructured":"Ganardi, M., Hucke, D., Lohrey, M., Benkner, L.S.: Universal tree source coding using grammar-based compression. IEEE Trans. Inf. Theory 65(10), 6399\u20136413 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Ganardi, M., Jez, A., Lohrey, M.: Balancing straight-line programs. In: Proceedings of the FOCS 2019, pp. 1169\u20131183. IEEE Computer Society (2019)","DOI":"10.1109\/FOCS.2019.00073"},{"key":"17_CR11","unstructured":"Ganczorz, M.: Entropy bounds for grammar compression. CoRR, abs\/1804.08547 (2018)"},{"key":"17_CR12","unstructured":"Ganczorz, M.: Using statistical encoding to achieve tree succinctness never seen before. In: Proceedings of the STACS 2020, LIPIcs, vol. 154, pp. 22:1\u201322:29. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00224-019-09942-y","volume":"64","author":"A Gasc\u00f3n","year":"2020","unstructured":"Gasc\u00f3n, A., Lohrey, M., Maneth, S., Reh, C.P., Sieber, K.: Grammar-based compression of unranked trees. Theory Comput. Syst. 64(1), 141\u2013176 (2020)","journal-title":"Theory Comput. Syst."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Hucke, D., Lohrey, M., Benkner, L.S.: Entropy bounds for grammar-based tree compressors. In: Proceedings of the ISIT 2019, pp. 1687\u20131691. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849372"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Hucke, D., Lohrey, M., Benkner, L.S.: Entropy bounds for grammar-based tree compressors. CoRR, abs\/1901.03155 (2019)","DOI":"10.1109\/ISIT.2019.8849372"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Hucke, D., Lohrey, M., Benkner, L.S.: A comparison of empirical tree entropies. CoRR, abs\/2006.01695 (2020)","DOI":"10.1007\/978-3-030-59212-7_17"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.jcss.2011.09.002","volume":"78","author":"J Jansson","year":"2012","unstructured":"Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2), 619\u2013631 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"8","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.is.2013.06.006","volume":"38","author":"M Lohrey","year":"2013","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: XML tree structure compression using RePair. Inf. Syst. 38(8), 1150\u20131167 (2013)","journal-title":"Inf. Syst."},{"issue":"3","key":"17_CR19","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. J. ACM 48(3), 407\u2013430 (2001)","journal-title":"J. ACM"},{"issue":"5","key":"17_CR20","doi-asserted-by":"publisher","first-page":"3160","DOI":"10.1109\/TIT.2018.2871452","volume":"65","author":"C Ochoa","year":"2019","unstructured":"Ochoa, C., Navarro, G.: RePair and all irreducible grammars are upper bounded by high-order empirical entropy. IEEE Trans. Inf. Theory 65(5), 3160\u20133164 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR21","unstructured":"Prezza, N.: On locating paths in compressed cardinal trees. CoRR, abs\/2004.01120 (2020)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59212-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T20:54:47Z","timestamp":1617310487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59212-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592110","9783030592127"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59212-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Orlando, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ucf.edu\/spire2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}