{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:24Z","timestamp":1792111464026,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":19,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_430","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:32:23Z","timestamp":1553095943000},"page":"401-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compressing and Indexing Structured Text"],"prefix":"10.1007","author":[{"given":"Paolo FerraginaSrinivasa Rao","family":"Satti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"430_CR3528","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.tcs.2007.07.015","volume":"387","author":"J Barbay","year":"2007","unstructured":"Barbay J, Golynski A, Munro JI, Rao SS (2007) Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor Comput Sci 387:284\u2013297","journal-title":"Theor Comput Sci"},{"key":"430_CR3529","doi-asserted-by":"crossref","unstructured":"Barbay J, He M, Munro JI, Rao SS (2011) Succinct indexes for strings, binary relations and multi-labeled trees. ACM Trans Algorithms 7(4):article 52","DOI":"10.1145\/2000807.2000820"},{"key":"430_CR3530","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 JI, Raman R, Raman V, Rao SS (2005) Representing trees of higher degree. Algorithmica 43:275\u2013292","journal-title":"Algorithmica"},{"key":"430_CR3531","unstructured":"Burrows M, Wheeler D (1994) A block sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation"},{"issue":"1","key":"430_CR3532","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00453-012-9664-0","volume":"68","author":"A Farzan","year":"2014","unstructured":"Farzan A, Munro JI (2014) A uniform paradigm to succinctly encode various families of trees. Algorithmica 68(1):16\u201340","journal-title":"Algorithmica"},{"key":"430_CR3533","doi-asserted-by":"crossref","unstructured":"Farzan A, Raman R, Rao SS (2009) Universal succinct representations of trees? In: Proceedings of the 36th international colloquium on automata, languages and programming (ICALP, Part I), Rhodes. Lecture notes in computer science, vol\u00a05555. Springer, pp\u00a0451\u2013462","DOI":"10.1007\/978-3-642-02927-1_38"},{"issue":"1","key":"430_CR3534","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 (2007) A simple storage scheme for strings achieving entropy bounds. Theor Comput Sci 372(1):115\u2013121","journal-title":"Theor Comput Sci"},{"key":"430_CR3535","doi-asserted-by":"crossref","unstructured":"Ferragina P, Luccio F, Manzini G, Muthukrishnan S (2005) Structuring labeled trees for optimal succinctness, and beyond. In: Proceedings of the 46th IEEE symposium on foundations of computer science (FOCS), Cambridge, pp\u00a0184\u2013193. The journal version of this paper appear in J ACM 57(1) (2009)","DOI":"10.1109\/SFCS.2005.69"},{"key":"430_CR3536","doi-asserted-by":"crossref","unstructured":"Ferragina P, Luccio F, Manzini G, Muthukrishnan S (2006) Compressing and searching XML data via two zips. In: Proceedings of the 15th World Wide Web conference (WWW), Edingburg, pp\u00a0751\u2013760","DOI":"10.1145\/1135777.1135891"},{"key":"430_CR3537","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/1198513.1198516","volume":"2","author":"R Geary","year":"2006","unstructured":"Geary R, Raman R, Raman V (2006) Succinct ordinal trees with level-ancestor queries. ACM Trans Algorithms 2:510\u2013534","journal-title":"ACM Trans Algorithms"},{"key":"430_CR3538","doi-asserted-by":"crossref","unstructured":"He M, Munro JI, Rao SS (2012) Succinct ordinal trees based on tree covering. ACM Trans Algorithms 8(4):article 42","DOI":"10.1145\/2344422.2344432"},{"key":"430_CR3539","doi-asserted-by":"crossref","unstructured":"He M, Munro JI, Zhou G (2012) A framework for succinct labeled ordinal trees over large\u00a0alphabets. In: Proceedings of the 23rd international symposium on algorithms and computation (ISAAC), Taipei. Lecture notes in computer science, vol\u00a07676. Springer, pp\u00a0537\u2013547","DOI":"10.1007\/978-3-642-35261-4_56"},{"key":"430_CR3540","doi-asserted-by":"crossref","unstructured":"Jacobson G (1989) Space-efficient static trees and graphs. In: Proceedings of the 30th IEEE symposium on foundations of computer science (FOCS), Triangle Park, pp\u00a0549\u2013554","DOI":"10.1109\/SFCS.1989.63533"},{"key":"430_CR3541","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 Ultra-succinct representation of ordered trees.\u00a0 J Comput Syst Sci 78: 619\u2013631 (2012)","journal-title":"J Comput Syst Sci"},{"key":"430_CR3542","doi-asserted-by":"crossref","unstructured":"Kosaraju SR (1989) Efficient tree pattern matching. In: Proceedings of the 20th IEEE foundations of computer science (FOCS), Triangle Park, pp\u00a0178\u2013183","DOI":"10.1109\/SFCS.1989.63475"},{"issue":"3","key":"430_CR3543","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"JI Munro","year":"2001","unstructured":"Munro JI, Raman V (2001) Succinct representation of balanced parentheses and static trees. SIAM J Comput 31(3):762\u2013776","journal-title":"SIAM J Comput"},{"key":"430_CR3544","doi-asserted-by":"crossref","unstructured":"Navarro G, M\u00e4kinen V (2007) Compressed full text indexes. ACM Comput Surv 39(1):article 2","DOI":"10.1145\/1216370.1216372"},{"key":"430_CR3545","doi-asserted-by":"crossref","unstructured":"Navarro G, Sadakane K (2014) Fully functional static and dynamic succinct trees. ACM Trans Algorithms 10(3):article 16","DOI":"10.1145\/2601073"},{"key":"430_CR3546","doi-asserted-by":"crossref","unstructured":"Raman R, Raman V, Rao SS (2007) Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. ACM Trans Algorithms 3(4):article 43","DOI":"10.1145\/1290672.1290680"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:48:53Z","timestamp":1792108133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_430","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}