{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T18:26:33Z","timestamp":1773858393263,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031661587","type":"print"},{"value":"9783031661594","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-66159-4_10","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"131-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["How to\u00a0Find Long Maximal Exact Matches and\u00a0Ignore Short Ones"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"10_CR1","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., I, T.: Refining the r-index. Theor. Comput. Sci. 812, 96\u2013108 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR2","unstructured":"Depuydt, L., et\u00a0al.: r-indexing without backward searching. arXiv preprint arXiv:2312.01359v2 (2024)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), article 20 (2007)","DOI":"10.1145\/1240233.1240243"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3375890","volume":"67","author":"T Gagie","year":"2020","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Fully functional suffix trees and optimal text searching in BWT-runs bounded space. J. ACM 67(1), 1\u201354 (2020)","journal-title":"J. ACM"},{"issue":"4","key":"10_CR5","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":"10_CR6","doi-asserted-by":"crossref","unstructured":"Gao, Y.: Computing matching statistics on repetitive texts. In: Data Compression Conference (DCC), pp. 73\u201382 (2022)","DOI":"10.1109\/DCC52660.2022.00015"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Goga, A., Depuydt, L., Brown, N.K., Fostier, J., Gagie, T., Navarro, G.: Faster maximal exact matches with lazy LCP evaluation. In: 2024 Data Compression Conference (DCC), pp. 123\u2013132 (2024)","DOI":"10.1109\/DCC58796.2024.00020"},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/3531445","volume":"65","author":"D Kempa","year":"2022","unstructured":"Kempa, D., Kociumaka, T.: Resolution of the Burrows-Wheeler transform conjecture. Commun. ACM 65(6), 91\u201398 (2022)","journal-title":"Commun. ACM"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kempa, D., Kociumaka, T.: Collapsing the hierarchy of compressed data structures: suffix arrays in optimal compressed space. In: 64th Symposium on Foundations of Computer Science (FOCS), pp. 1877\u20131886 (2023)","DOI":"10.1109\/FOCS57990.2023.00114"},{"issue":"14","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1093\/bioinformatics\/bts280","volume":"28","author":"H Li","year":"2012","unstructured":"Li, H.: Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics 28(14), 1838\u20131844 (2012)","journal-title":"Bioinformatics"},{"key":"10_CR11","unstructured":"Li, H.: Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM. arXiv preprint arXiv:1303.3997 (2013)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing, 2nd edn. Cambridge University Press, Cambridge (2023)","DOI":"10.1017\/9781009341257"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284","volume-title":"Compact Data Structures: A Practical Approach","author":"G Navarro","year":"2016","unstructured":"Navarro, G.: Compact Data Structures: A Practical Approach. Cambridge University Press, Cambridge (2016)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Computing MEMs on repetitive text collections. In: 34th Symposium on Combinatorial Pattern Matching (CPM) (2023)","DOI":"10.1145\/3701561"},{"key":"10_CR15","unstructured":"Nishimoto, T., Tabei, Y.: Optimal-time queries on BWT-runs compressed indexes. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP) (2021)"},{"key":"10_CR16","unstructured":"Ohlebusch, E.: Bioinformatics algorithms: sequence analysis, genome rearrangements, and phylogenetic reconstruction. Oldenbusch Verlag (2013)"},{"issue":"2","key":"10_CR17","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":"10_CR18","doi-asserted-by":"crossref","unstructured":"Verbin, E., Yu, W.: Data structure lower bounds on random access to grammar-compressed strings. In: 24th Symposium on Combinatorial Pattern Matching (CPM), pp. 247\u2013258 (2013)","DOI":"10.1007\/978-3-642-38905-4_24"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66159-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T21:41:14Z","timestamp":1732484474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_10","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":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}