{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:47:06Z","timestamp":1743065226070,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031721991"},{"type":"electronic","value":"9783031722004"}],"license":[{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-72200-4_14","type":"book-chapter","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:01:50Z","timestamp":1726686110000},"page":"184-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Another Virtue of\u00a0Wavelet Forests"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7138-182X","authenticated-orcid":false,"given":"Aaron","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9509-9725","authenticated-orcid":false,"given":"Christina","family":"Boucher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yansong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0562-1629","authenticated-orcid":false,"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"14_CR1","unstructured":"Bowe, A.: Multiary wavelet trees in practice. Bachelor\u2019s thesis, RMIT University, Melbourne, Australia (2010)"},{"key":"14_CR2","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Tech. Rep.\u00a0124, Digital Equipment Corporation (1994)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Ceregini, M., Kurpicz, F., Venturini, R.: Faster wavelet trees with quad vectors. arXiv preprint arXiv:2302.09239 (2023)","DOI":"10.1109\/DCC58796.2024.00030"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/s00453-013-9792-1","volume":"71","author":"YF Chien","year":"2015","unstructured":"Chien, Y.F., Hon, W.K., Shah, R., Thankachan, S.V., Vitter, J.S.: Geometric BWT: compressed text indexing via sparse suffixes and range searching. Algorithmica 71(2), 258\u2013278 (2015)","journal-title":"Algorithmica"},{"key":"14_CR5","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.: The wavelet matrix: an efficient wavelet tree for large alphabets. Inf. Syst. 47, 15\u201332 (2015)","journal-title":"Inf. Syst."},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1145\/1082036.1082043","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. J. ACM 52(4), 688\u2013713 (2005)","journal-title":"J. ACM"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Proceedings of the 13th Symposium on Experimental Algorithms (SEA), pp. 326\u2013337 (2014)","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1007\/s00453-018-0475-9","volume":"81","author":"S Gog","year":"2019","unstructured":"Gog, S., K\u00e4rkk\u00e4inen, J., Kempa, D., Petri, M., Puglisi, S.J.: Fixed block compression boosting in FM-indexes: theory and practice. Algorithmica 81, 1370\u20131391 (2019)","journal-title":"Algorithmica"},{"key":"14_CR10","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the 14th Symposium on Discrete Algorithms (SODA), pp. 841\u2013850 (2003)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Puglisi, S.J.: Fixed block compression boosting in FM-indexes. In: Proceedings of the 18th Symposium on String Processing and Information Retrieval (SPIRE), pp. 174\u2013184 (2011)","DOI":"10.1007\/978-3-642-24583-1_18"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead, B., Salzberg, S.L.: Fast gapped-read alignment with bowtie 2. Nat. Methods 9(4), 357\u2013359 (2012)","journal-title":"Nat. Methods"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2009-10-3-r25","volume":"10","author":"B Langmead","year":"2009","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.L.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10(3), 1\u201310 (2009)","journal-title":"Genome Biol."},{"issue":"14","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Navarro, G.: Implicit compression boosting with applications to self-indexing. In: Proceedings of the 14th Symposium on String Processing and Information Retrieval (SPIRE), pp. 229\u2013241 (2007)","DOI":"10.1007\/978-3-540-75530-2_21"},{"key":"14_CR16","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.: Wavelet trees for all. J. Discrete Algorithms 25, 2\u201320 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72200-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:02:34Z","timestamp":1726686154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72200-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,19]]},"ISBN":["9783031721991","9783031722004"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72200-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,9,19]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Vallarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/computo.fismat.umich.mx\/spire2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}