{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T15:43:24Z","timestamp":1776008604139,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902512","type":"print"},{"value":"9783031902529","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-90252-9_12","type":"book-chapter","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T20:03:20Z","timestamp":1745525000000},"page":"190-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Pangenomic Classification Accuracy with\u00a0Chain Statistics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6201-2301","authenticated-orcid":false,"given":"Nathaniel K.","family":"Brown","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1424-3711","authenticated-orcid":false,"given":"Vikram S.","family":"Shivakumar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2437-1976","authenticated-orcid":false,"given":"Ben","family":"Langmead","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1186\/s13059-023-02958-1","volume":"24","author":"O Ahmed","year":"2023","unstructured":"Ahmed, O., Rossi, M., Gagie, T., Boucher, C., Langmead, B.: SPUMONI 2: improved classification using a pangenome index of minimizer digests. Genome Biol. 24(1), 122 (2023)","journal-title":"Genome Biol."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, O., et al.: Pan-genomic matching statistics for targeted nanopore sequencing. iScience 24(6) (2021)","DOI":"10.1016\/j.isci.2021.102696"},{"key":"12_CR3","unstructured":"Baier, U.: On undetected redundancy in the burrows-wheeler transform. In: 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), vol. 105, pp. 3:1\u20133:15 (2018)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Baier, U., Dede, K.: BWT tunnel planning is hard but manageable. In: 2019 Data Compression Conference (DCC), pp. 142\u2013151 (2019)","DOI":"10.1109\/DCC.2019.00022"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bal\u00e1\u017e, A., et al.: Wheeler maps. In: Latin American Symposium on Theoretical Informatics, pp. 178\u2013192 (2024)","DOI":"10.1007\/978-3-031-55598-5_12"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2019.08.005","volume":"812","author":"H Bannai","year":"2020","unstructured":"Bannai, H., Gagie, T., Tomohiro, I.: Refining the R-index. Theoret. Comput. Sci. 812, 96\u2013108 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2024.105155","volume":"298","author":"C Boucher","year":"2024","unstructured":"Boucher, C., Cenzato, D., Lipt\u00e1k, Z., Rossi, M., Sciortino, M.: r-indexing the eBWT. Inf. Comput. 298, 105155 (2024)","journal-title":"Inf. Comput."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-019-0148-5","volume":"14","author":"C Boucher","year":"2019","unstructured":"Boucher, C., Gagie, T., Kuhnle, A., Langmead, B., Manzini, G., Mun, T.: Prefix-free parsing for building big BWTs. Algorithms Mol. Biol. 14, 1\u201315 (2019)","journal-title":"Algorithms Mol. Biol."},{"key":"12_CR9","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Digit. Equip. Corp. (1994)"},{"key":"12_CR10","unstructured":"Deogun, J.S., Yang, J., Ma, F.: EMAGEN: an efficient approach to multiple whole genome alignment. In: Proceedings of the Second Conference on Asia-Pacific Bioinformatics, vol. 29, pp. 113\u2013122 (2004)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Gagie, T., et al.: Practical random access to SLP-compressed texts. In: International Symposium on String Processing and Information Retrieval, pp. 221\u2013231 (2020)","DOI":"10.1007\/978-3-030-59212-7_16"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Optimal-time text indexing in BWT-runs bounded space. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1459\u20131477 (2018)","DOI":"10.1137\/1.9781611975031.96"},{"issue":"D1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"D762","DOI":"10.1093\/nar\/gkad988","volume":"52","author":"D Haft","year":"2024","unstructured":"Haft, D., et al.: RefSeq and the prokaryotic genome annotation pipeline in the age of metagenomes. Nucleic Acids Res. 52(D1), D762\u2013D769 (2024)","journal-title":"Nucleic Acids Res."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kuhnle, A., Mun, T., Boucher, C., Gagie, T., Langmead, B., Manzini, G.: Efficient construction of a complete index for pan-genomics read alignment. In: International Conference on Research in Computational Molecular Biology, pp. 158\u2013173 (2019)","DOI":"10.1007\/978-3-030-17083-7_10"},{"issue":"18","key":"12_CR15","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1093\/bioinformatics\/bty191","volume":"34","author":"H Li","year":"2018","unstructured":"Li, H.: Minimap2: pairwise alignment for nucleotide sequences. Bioinformatics 34(18), 3094\u20133100 (2018)","journal-title":"Bioinformatics"},{"issue":"7960","key":"12_CR16","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1038\/s41586-023-05896-x","volume":"617","author":"W Liao","year":"2023","unstructured":"Liao, W., et al.: A draft human pangenome reference. Nature 617(7960), 312\u2013324 (2023)","journal-title":"Nature"},{"issue":"5","key":"12_CR17","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"12_CR18","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1038\/s41587-020-0422-6","volume":"38","author":"EL Moss","year":"2020","unstructured":"Moss, E.L., Maghini, D.G., Bhatt, A.S.: Complete, closed bacterial genomes from microbiomes using nanopore sequencing. Nat. Biotechnol. 38(6), 701\u2013707 (2020)","journal-title":"Nat. Biotechnol."},{"key":"12_CR19","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: SODA, vol. 2, pp. 657\u2013666 (2002)"},{"key":"12_CR20","unstructured":"Nishimoto, T., Tabei, Y.: Optimal-time queries on BWT-runs compressed indexes. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), vol. 198, pp. 101:1\u2013101:15 (2021)"},{"issue":"6588","key":"12_CR21","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1126\/science.abj6987","volume":"376","author":"S Nurk","year":"2022","unstructured":"Nurk, S., et al.: The complete sequence of a human genome. Science 376(6588), 44\u201353 (2022)","journal-title":"Science"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Ono, Y., Hamada, M., Asai, K.: PBSIM3: a simulator for all types of PacBio and ONT long reads. NAR Genom. Bioinform. 4(4), lqac092 (2022)","DOI":"10.1093\/nargab\/lqac092"},{"issue":"2","key":"12_CR23","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."},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.26502\/jbb.2642-91280067","volume":"6","author":"H Sadasivan","year":"2023","unstructured":"Sadasivan, H., Maric, M., Dawson, E., Iyer, V., Israeli, J., Narayanasamy, S.: Accelerating minimap2 for accurate long read alignment on GPUs. J. Biotechnol. Biomed. 6(1), 13\u201323 (2023)","journal-title":"J. Biotechnol. Biomed."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Shivakumar, V.S., Ahmed, O.Y., Kovaka, S., Zakeri, M., Langmead, B.: Sigmoni: classification of nanopore signal with a compressed pangenome index. Bioinformatics 40(Supplement_1), i287\u2013i296 (2024)","DOI":"10.1093\/bioinformatics\/btae213"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Shivakumar, V.S., Langmead, B.: Mumemto: efficient maximal matching across pangenomes. bioRxiv (2025)","DOI":"10.1101\/2025.01.05.631388"},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"DE Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space $$\\theta $$ (n). Inf. Process. Lett. 17(2), 81\u201384 (1983)","journal-title":"Inf. Process. Lett."},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Zakeri, M., Brown, N.K., Ahmed, O.Y., Gagie, T., Langmead, B.: Movi: a fast and cache-efficient full-text pangenome index. iScience 27(12) (2024)","DOI":"10.1016\/j.isci.2024.111464"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90252-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T20:03:27Z","timestamp":1745525007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90252-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902512","9783031902529"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90252-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"25 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Ben Langmead is the founder of InOrder Labs, LLC.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb.org\/recomb2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}