{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:02:32Z","timestamp":1774990952206,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541492","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1217-1221","source":"Crossref","is-referenced-by-count":5,"title":["Lossless compression of binary trees with correlated vertex names"],"prefix":"10.1109","author":[{"given":"Abram","family":"Magner","sequence":"first","affiliation":[{"name":"Coordinated Science Laboratory, Univ. of Illinois at Urbana-Champaign, USA"}]},{"given":"Krzysztof","family":"Turowski","sequence":"additional","affiliation":[{"name":"Dept. of Algorithms and System Modeling, Gdansk University of Technology, Poland"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University, West Lafayette, IN, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0025-5564(00)00061-4"},{"key":"ref12","first-page":"544","article-title":"Tree Zip: A New Algorithm for Compressing Large Collections of Evolutionary Trees","author":"matthews","year":"2010","journal-title":"Data Compression Conference"},{"key":"ref13","author":"drmota","year":"2009","journal-title":"Random Trees An Interplay between Combinatorics and Probability"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0025-5564(99)00060-7","article-title":"Distributions of cherries for two models of trees","volume":"164","author":"steel","year":"2000","journal-title":"Mathematical Biosciences"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032234"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2007.73"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90126-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2295392"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205704"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90011-Z"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964813000399"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541492.pdf?arnumber=7541492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:35Z","timestamp":1774986755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541492\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541492","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}