{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:33:01Z","timestamp":1794357181395,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_430","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:37:39Z","timestamp":1214491059000},"page":"964-968","source":"Crossref","is-referenced-by-count":2,"title":["Tree Compression and Indexing"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"430_CR1_430","doi-asserted-by":"crossref","unstructured":"Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. In: Proc. 17th Combinatorial Pattern Matching (CPM). LNCS n.\u00a04009 Springer, Barcelona (2006), pp.\u00a024\u201335","DOI":"10.1007\/11780441_4"},{"key":"430_CR2_430","unstructured":"Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, USA, (2007), pp.\u00a0680\u2013689"},{"key":"430_CR3_430","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D. Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43, \u00a0275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"430_CR4_430","unstructured":"Burrows, M., Wheeler, D.: A\u00a0block sorting lossless data compression algorithm. Tech. Report 124, Digital Equipment Corporation (1994)"},{"key":"430_CR5_430","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0184\u2013193. Cambridge, USA (2005)","DOI":"10.1109\/SFCS.2005.69"},{"key":"430_CR6_430","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and searching XML data via two zips. In: Proc. 15th World Wide Web Conference (WWW), pp.\u00a0751\u2013760. Edingburg, UK(2006)","DOI":"10.1145\/1135777.1135891"},{"key":"430_CR7_430","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2006.12.012","volume":"372","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Venturini, R.: A\u00a0simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372, (1):115\u2013121 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"430_CR8_430","unstructured":"Geary, R., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a01\u201310. New Orleans, USA (2004)"},{"key":"430_CR9_430","doi-asserted-by":"crossref","unstructured":"He, M., Munro, J.I., Rao, S.S.: Succinct ordinal trees based on tree covering. In: Proc. 34th International Colloquium on Algorithms, Language and Programming (ICALP). LNCS n.\u00a04596, pp.\u00a0509\u2013520. Springer, Wroclaw, Poland (2007)","DOI":"10.1007\/978-3-540-73420-8_45"},{"key":"430_CR10_430","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0549\u2013554. Triangle Park, USA (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"430_CR11_430","unstructured":"Jansson, J., Sadakane, K., Sung, W.: Ultra-succinct representation of ordered trees. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0575\u2013584. New Orleans, USA(2007)"},{"key":"430_CR12_430","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Efficient tree pattern matching. In: Proc. 20th IEEE Foundations of Computer Science (FOCS), pp.\u00a0178\u2013183. Triangle Park, USA (1989)","DOI":"10.1109\/SFCS.1989.63475"},{"issue":"3","key":"430_CR13_430","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"430_CR14_430","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full text indexes. ACM Comput. Surv. 39(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"430_CR15_430","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0233\u2013242. San Francisco, USA (2002)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:51Z","timestamp":1738254771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_430"}},"subtitle":["2005; Ferragina, Luccio, Manzini, Muthukrishnan"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_430","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}