{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:45Z","timestamp":1759638225601},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319460482"},{"type":"electronic","value":"9783319460499"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46049-9_5","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T11:02:06Z","timestamp":1474369326000},"page":"50-60","source":"Crossref","is-referenced-by-count":2,"title":["Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Fari\u00f1a","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Ord\u00f3\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.is.2014.06.002","volume":"47","author":"F Claude","year":"2015","unstructured":"Claude, F., Navarro, G., Ord\u00f3\u00f1ez, A.: The wavelet matrix: an efficient wavelet tree for large alphabets. Inf. Syst. 47, 15\u201332 (2015)","journal-title":"Inf. Syst."},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S0196-6774(03)00094-4","volume":"50","author":"W Evans","year":"2004","unstructured":"Evans, W., Kirkpatrick, D.G.: Restructuring ordered binary trees. J. Algorithms 50, 168\u2013193 (2004)","journal-title":"J. Algorithms"},{"issue":"2","key":"5_CR3","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences, full-text indexes. ACM Trans. Algorithm 3(2), 20 (2007)","journal-title":"ACM Trans. Algorithm"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-642-24583-1_29","volume-title":"String Processing and Information Retrieval","author":"T Gagie","year":"2011","unstructured":"Gagie, T., He, M., Munro, J.I., Nicholson, P.K.: Finding frequent elements in compressed 2D arrays and strings. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 295\u2013300. Springer, Heidelberg (2011)"},{"issue":"9","key":"5_CR5","doi-asserted-by":"crossref","first-page":"4999","DOI":"10.1109\/TIT.2015.2452252","volume":"61","author":"T Gagie","year":"2015","unstructured":"Gagie, T., Navarro, G., Nekrich, Y., Ord\u00f3\u00f1ez, A.: Efficient and compact representations of prefix codes. IEEE Trans. Inf. Theory 61(9), 4999\u20135011 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR6","unstructured":"Grossi, R., Gupta, A., and Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings SODA, pp. 841\u2013850 (2003)"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1137\/0205002","volume":"5","author":"A Itai","year":"1976","unstructured":"Itai, A.: Optimal alphabetic trees. SIAM J. Comp. 5, 9\u201318 (1976)","journal-title":"SIAM J. Comp."},{"key":"5_CR8","unstructured":"Kraft, L.G.: A device for quantizing, grouping, and coding amplitude modulated pulses. M.Sc. thesis, EE Dept., MIT (1949)"},{"issue":"3","key":"5_CR9","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"JI Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comp. 31(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comp."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","volume":"25","author":"G Navarro","year":"2014","unstructured":"Navarro, G.: Wavelet trees for all. J. Discr. Algorithm 25, 2\u201320 (2014)","journal-title":"J. Discr. Algorithm"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-642-30850-5_26","volume-title":"Experimental Algorithms","author":"G Navarro","year":"2012","unstructured":"Navarro, G., Providel, E.: Fast, small, simple rank\/select on bitmaps. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 295\u2013306. Springer, Heidelberg (2012)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M.: Succincter. In: Proceedings FOCS, pp. 305\u2013313 (2008)","DOI":"10.1109\/FOCS.2008.83"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/363958.363991","volume":"7","author":"ES Schwartz","year":"1964","unstructured":"Schwartz, E.S., Kallick, B.: Generating a canonical prefix encoding. Commun. ACM 7, 166\u2013169 (1964)","journal-title":"Commun. ACM"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0020-0190(76)90052-1","volume":"4","author":"RL Wessner","year":"1976","unstructured":"Wessner, R.L.: Optimal alphabetic search trees with restricted maximal height. Inf. Proc. Lett. 4, 90\u201394 (1976)","journal-title":"Inf. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46049-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T16:13:17Z","timestamp":1568391197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46049-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319460482","9783319460499"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46049-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}