{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:54:27Z","timestamp":1725854067031},"publisher-location":"New York, NY","reference-count":14,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"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_642","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:07:11Z","timestamp":1553094431000},"page":"2355-2359","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Wavelet Trees"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Grossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"472_CR2333","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2013.10.019","volume":"513","author":"J Barbay","year":"2013","unstructured":"Barbay J, Navarro G (2013) On compressing permutations and adaptive sorting. Theor Comput Sci 513:109\u2013123","journal-title":"Theor Comput Sci"},{"issue":"2","key":"472_CR2334","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/2151171.2151173","volume":"8","author":"P Bose","year":"2012","unstructured":"Bose P, Chen EY, He M, Maheshwari A, Morin P (2012) Succinct geometric indexes supporting point location queries. ACM Trans Algorithms 8(2):10","journal-title":"ACM Trans Algorithms"},{"issue":"3","key":"472_CR2335","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B Chazelle","year":"1988","unstructured":"Chazelle B (1988) A functional approach to data structures and its use in multidimensional searching. SIAM J Comput 17(3):427\u2013462","journal-title":"SIAM J Comput"},{"key":"472_CR2336","doi-asserted-by":"publisher","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 (2015) The wavelet matrix: an efficient wavelet tree for large alphabets. Inf Syst 47:15\u201332","journal-title":"Inf Syst"},{"issue":"2","key":"472_CR2337","doi-asserted-by":"publisher","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 (2007) Compressed representations of sequences and full-text indexes. ACM Trans Algorithms 3(2):20","journal-title":"ACM Trans Algorithms"},{"issue":"8","key":"472_CR2338","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.ic.2008.12.010","volume":"207","author":"P Ferragina","year":"2009","unstructured":"Ferragina P, Giancarlo R, Manzini G (2009) The myriad virtues of wavelet trees. Inf Comput 207(8):849\u2013866","journal-title":"Inf Comput"},{"key":"472_CR2339","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03784-9_1","volume-title":"String processing and information retrieval","author":"T Gagie","year":"2009","unstructured":"Gagie T, Puglisi SJ, Turpin A (2009) Range quantile queries: another virtue of wavelet trees. In: String processing and information retrieval, Saariselk\u00e4. Springer, pp\u00a01\u20136"},{"key":"472_CR2340","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2011.12.002","volume":"426","author":"T Gagie","year":"2012","unstructured":"Gagie T, Navarro G, Puglisi SJ (2012) New algorithms on wavelet trees and applications to information retrieval. Theor Comput Sci 426:25\u201341","journal-title":"Theor Comput Sci"},{"key":"472_CR2341","doi-asserted-by":"crossref","unstructured":"Grossi R, Ottaviano G (2012) The wavelet trie: maintaining an indexed sequence of strings in compressed space. In: Kr\u00f6tzsch M, Lenzerini M, Benedikt M (eds) PODS\u201912: proceedings of the 31st ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, Scottsdale, 20\u201324 May 2012. ACM, pp\u00a0203\u2013214","DOI":"10.1145\/2213556.2213586"},{"key":"472_CR2342","series-title":"Society for Industrial and Applied Mathematics","first-page":"841","volume-title":"Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore","author":"R Grossi","year":"2003","unstructured":"Grossi R, Gupta A, Vitter JS (2003) High-order entropy-compressed text indexes. In: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore. Society for Industrial and Applied Mathematics, pp\u00a0841\u2013850"},{"key":"472_CR2343","series-title":"Society for Industrial and Applied Mathematics","first-page":"636","volume-title":"Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, New Orleans","author":"R Grossi","year":"2004","unstructured":"Grossi R, Gupta A, Vitter JS (2004) When indexing equals compression: experiments with compressing suffix arrays and applications. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, New Orleans. Society for Industrial and Applied Mathematics, pp\u00a0636\u2013645"},{"key":"472_CR2344","unstructured":"K\u00e4rkk\u00e4inen J (1999) Repetition-based text indexing. PhD thesis, University of Helsinki, Finland"},{"issue":"2","key":"472_CR2345","doi-asserted-by":"publisher","first-page":"585","DOI":"10.2298\/CSIS110606004M","volume":"9","author":"C Makris","year":"2012","unstructured":"Makris C (2012) Wavelet trees: a survey. Comput Sci Inf Syst 9(2):585\u2013625","journal-title":"Comput Sci Inf Syst"},{"key":"472_CR2346","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","volume":"25","author":"G Navarro","year":"2014","unstructured":"Navarro G (2014) Wavelet trees for all. J Discret Algorithms 25:2\u201320","journal-title":"J Discret Algorithms"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:34:54Z","timestamp":1553096094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_642","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"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}