{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T10:31:13Z","timestamp":1769855473797,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031555978","type":"print"},{"value":"9783031555985","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55598-5_12","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:01:53Z","timestamp":1709661713000},"page":"178-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Wheeler Maps"],"prefix":"10.1007","author":[{"given":"Andrej","family":"Bal\u00e1\u017e","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adri\u00e1n","family":"Goga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Heumos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessia","family":"Petescia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jouni","family":"Sir\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-67428-5_7","volume-title":"String Processing and Information Retrieval","author":"G Bernardini","year":"2017","unstructured":"Bernardini, G., Pisanti, N., Pissis, S.P., Rosone, G.: Pattern matching on elastic-degenerate text with errors. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 74\u201390. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_7"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bille, P., G\u00f8rtz, I.L., Cording, P.H., Sach, B., Vildh\u00f8j, H.W., Vind, S.: Fingerprints in compressed strings. J. Comput. Syst. Sci. 86 171\u2013180 (2017)","DOI":"10.1016\/j.jcss.2017.01.002"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Boucher, C., et al. PHONI: Streamed matching statistics with multi-genome references. In: Proceedings 31st Data Compression Conference (DCC), pp. 193\u2013202 (2021)","DOI":"10.1109\/DCC50243.2021.00027"},{"key":"12_CR4","volume-title":"A block-sorting lossless data compression algorithm","author":"M Burrows","year":"1994","unstructured":"Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. In Digital SRC Research Report, Citeseer (1994)"},{"key":"12_CR5","unstructured":"Cobas, D., Gagie, T., Navarro, G.: A fast and small subsampled R-Index. In: Proceedings 32nd Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 13:1\u201313:16 (2021)"},{"issue":"1","key":"12_CR6","first-page":"118","volume":"19","author":"Computational Pan-Genomics Consortium","year":"2018","unstructured":"Computational Pan-Genomics Consortium: Computational pan-genomics: status, promises and challenges. Brief. Bioinform. 19(1), 118\u2013135 (2018)","journal-title":"Brief. Bioinform."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Cotumaccio, N., Prezza, N.: On indexing and compressing finite automata. In: Proceedings 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2585\u20132599 (2021)","DOI":"10.1137\/1.9781611976465.153"},{"key":"12_CR8","unstructured":"Dolgin, E.: Scientists unveil a more diverse human genome (2023) Accessed 3 Jan 2024"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Equi, M., M\u00e4kinen, V., Tomescu, AI.: Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. In: Proceedings Theory and Practice of Computer Science (SOFSEM), pp. 608\u2013622 (2021)","DOI":"10.1007\/978-3-030-67731-2_44"},{"issue":"4","key":"12_CR10","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"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2017.06.016","volume":"698","author":"T Gagie","year":"2017","unstructured":"Gagie, T., Manzini, G., Sir\u00e9n, J.: Wheeler graphs: framework for BWT-based data structures. Theoret. Comput. Sci. 698, 67\u201378 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Optimal-time text indexing in BWT-runs bounded space. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1459\u20131477 (2018)","DOI":"10.1137\/1.9781611975031.96"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3457389","volume":"68","author":"M Ganardi","year":"2021","unstructured":"Ganardi, M., Je\u017c, A., Lohrey, M.: Balancing straight-line programs. J. ACM 68(4), 1\u201340 (2021)","journal-title":"J. ACM"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Garrison, E., et al.: Variation graph toolkit improves read mapping by representing genetic variation in the reference. Nature Biotechnol. 36(9), 875\u2013879 (2018)","DOI":"10.1038\/nbt.4227"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Langmead, B., Salzberg, S.L.: Fast gapped-read alignment with Bowtie 2. Nature Methods, 9(4), 357\u2013359 (2012)","DOI":"10.1038\/nmeth.1923"},{"issue":"14","key":"12_CR17","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":"12_CR18","doi-asserted-by":"crossref","unstructured":"Liao, W.W., et\u00a0al.: A draft human pangenome reference. Nature 617(7960), 312\u2013324 (2023)","DOI":"10.1530\/ey.20.12.1"},{"key":"12_CR19","unstructured":"M\u00e4kinen, V., Cazaux, B., Equi, M., Norri, T., Tomescu, A.I.: Linear time construction of indexable founder block graphs. In: 20th International Workshop on Algorithms in Bioinformatics (WABI), pp. 7:1\u20137:18 (2020)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11496656_5","volume-title":"Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005. Proceedings","author":"V M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. In: Apostolico, A., Crochemore, M., Park, K. (eds.) Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005. Proceedings, pp. 45\u201356. Springer Berlin Heidelberg, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496656_5"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol. 17(3), 281\u2013308 (2010)","journal-title":"J. Comput. Biol."},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762\u2013776 (2001)","DOI":"10.1137\/S0097539799364092"},{"key":"12_CR23","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 657\u2013666, (2002)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv., 39(1)article 2 (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Compact data structures: a practical approach. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781316588284"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part II: compressed indexes. ACM Comput. Surv. 54(2), article 26 (2021)","DOI":"10.1145\/3432999"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2018.09.007","volume":"762","author":"G Navarro","year":"2019","unstructured":"Navarro, G., Prezza, N.: Universal compressed text indexing. Theoret. Comput. Sci. 762, 41\u201350 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-31155-0_24","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"Y Nekrich","year":"2012","unstructured":"Nekrich, Y., Navarro, G.: Sorted range reporting. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 271\u2013282. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_24"},{"key":"12_CR29","unstructured":"Nishimoto, T., Tabei, Y.: Optimal-time queries on BWT-runs compressed indexes. In: Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), pp. 101:1\u2013101:15 (2021)"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Reich, D.E., et al.: Linkage disequilibrium in the human genome. Nature, 411(6834), 199\u2013204 (2001)","DOI":"10.1038\/35075590"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Rizzo, N., C\u00e1ceres, M., M\u00e4kinen, V.: Finding maximal exact matches in graphs. In: Proceedings of the Workshop on Algorithms in Bioinformatics (WABI), pp. 10:1\u201310:17 (2023)","DOI":"10.1186\/s13015-024-00255-5"},{"issue":"2","key":"12_CR32","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1089\/cmb.2021.0290","volume":"29","author":"M Rossi","year":"2022","unstructured":"Rossi, M., Oliva, M., Langmead, B., Gagie, T., Boucher, C.: MONI: a pangenomic index for finding maximal exact matches. J. Comput. Biol. 29(2), 169\u2013187 (2022)","journal-title":"J. Comput. Biol."},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Russo, L.M., Navarro, G., Oliveira, A.L.: Fully-compressed suffix trees. ACM Trans. Algorith. 7(4):article 53 (2011)","DOI":"10.1145\/2000807.2000821"},{"key":"12_CR34","unstructured":"Steinmark, E.M.: The human genome needs updating but how do we make it fair? (2023). Accessed 3 Jan 2024"},{"key":"12_CR35","unstructured":"Tatarnikov, I., Farahani, A.S., Kashgouli, S., Gagie, T.: MONI can find $$k$$-MEMs. In: Proceedings 34th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 26:1\u201326:14 (2023)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55598-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T21:30:45Z","timestamp":1731533445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55598-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031555978","9783031555985"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55598-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","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":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}