{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:51:22Z","timestamp":1773388282225,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9781071639887","type":"print"},{"value":"9781071639894","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-1-0716-3989-4_11","type":"book-chapter","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T08:02:38Z","timestamp":1715846558000},"page":"164-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Automated Design of\u00a0Efficient Search Schemes for\u00a0Lossless Approximate Pattern Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2244-1427","authenticated-orcid":false,"given":"Luca","family":"Renders","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8517-0479","authenticated-orcid":false,"given":"Lore","family":"Depuydt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8536-6065","authenticated-orcid":false,"given":"Sven","family":"Rahmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9994-8269","authenticated-orcid":false,"given":"Jan","family":"Fostier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Alanko, J.N., Slizovskiy, I.B., Lokshtanov, D., Gagie, T., Noyes, N.R., Boucher, C.: Syotti: scalable bait design for DNA enrichment. Bioinformatics 38(Suppl. 1), i177\u2013i184 (2022). https:\/\/doi.org\/10.1093\/bioinformatics\/btac226","DOI":"10.1093\/bioinformatics\/btac226"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403\u201310 (1990)","journal-title":"J. Mol. Biol."},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Claeys, A., Merseburger, P., Staut, J., Marchal, K., den Eynden, J.V.: Benchmark of tools for in silico prediction of MHC class I and class II genotypes from NGS data. BMC Genomics 24, 247 (2023). https:\/\/doi.org\/10.1186\/s12864-023-09351-z","DOI":"10.1186\/s12864-023-09351-z"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Depuydt, L., Renders, L., Abeel, T., Fostier, J.: Pan-genome de Bruijn graph using the bidirectional FM-index. BMC Bioinform. 24(1), 400 (2023). https:\/\/doi.org\/10.1186\/s12859-023-05531-6","DOI":"10.1186\/s12859-023-05531-6"},{"key":"11_CR5","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1. Wiley, New York (1968)"},{"key":"11_CR6","unstructured":"IBM-ILOG: CPLEX (2022). https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.1?topic=documentation-introducing-ilog-cplex-optimization-studio-2211. Accessed 2 Jul 2023"},{"key":"11_CR7","unstructured":"Kianfar, K., Pockrandt, C., Torkamandi, B., Luo, H., Reinert, K.: FAMOUS: fast approximate string matching using optimum search schemes. CoRR (2017). http:\/\/arxiv.org\/abs\/1711.02035"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-07566-2_23","volume-title":"Combinatorial Pattern Matching","author":"G Kucherov","year":"2014","unstructured":"Kucherov, G., Salikhov, K., Tsur, D.: Approximate string matching using a bidirectional index. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 222\u2013231. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_23"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Lam, T., Li, R., Tam, A., Wong, S., Wu, E., Yiu, S.: High throughput short read alignment via bi-directional BWT. In: IEEE International Conference on Bioinformatics and Biomedicine, December 2009, pp. 31\u201336 (2009). https:\/\/doi.org\/10.1109\/BIBM.2009.42","DOI":"10.1109\/BIBM.2009.42"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/0471250953.bi1107s32","volume":"32","author":"B Langmead","year":"2010","unstructured":"Langmead, B.: Aligning short sequencing reads with Bowtie. Curr. Protoc. Bioinform. 32(1), 11\u20137 (2010)","journal-title":"Curr. Protoc. Bioinform."},{"issue":"14","key":"11_CR11","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). https:\/\/doi.org\/10.1093\/bioinformatics\/btp324","journal-title":"Bioinformatics"},{"issue":"16","key":"11_CR12","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., et al.: 1000 genome project data processing subgroup: the sequence alignment\/map format and SAMtools. Bioinformatics 25(16), 2078\u20132079 (2009)","journal-title":"Bioinformatics"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Marco-Sola, S., Sammeth, M., Guig\u00f3, R., Ribeca, P.: The GEM mapper: fast, accurate and versatile alignment by filtration. Nat. Meth. 9(12), 1185\u20131188 (2012). https:\/\/doi.org\/10.1028\/nmeth.2221","DOI":"10.1028\/nmeth.2221"},{"key":"11_CR14","unstructured":"Pockrandt, C.M.: Approximate string matching: improving data structures and algorithms. Ph.D. thesis, Freien Universit\u00e4t Berlin (2019). http:\/\/dx.doi.org\/10.17169\/refubium-2185"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Renders, L., Depuydt, L., Fostier, J.: Approximate pattern matching using search schemes and in-text verification. In: Rojas, I., Valenzuela, O., Rojas, F., Herrera, L.J., Ortu\u00f1o, F. (eds.) Bioinformatics and Biomedical Engineering, IWBBIO 2022. LNCS, pp. 419\u2013435. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07802-6_36","DOI":"10.1007\/978-3-031-07802-6_36"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Renders, L., Marchal, K., Fostier, J.: Dynamic partitioning of search patterns for approximate pattern matching using search schemes. iScience 24(7), 102687 (2021). https:\/\/doi.org\/10.1016\/j.isci.2021.102687","DOI":"10.1016\/j.isci.2021.102687"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Schneider, V., et al.: Evaluation of GRCh38 and de novo haploid genome assemblies demonstrates the enduring quality of the reference assembly. Genome Res. 27 (2017). https:\/\/doi.org\/10.1101\/gr.213611.116","DOI":"10.1101\/gr.213611.116"},{"key":"11_CR18","unstructured":"Siragusa, E.: Approximate string matching for high-throughput sequencing. Ph.D. thesis (2015)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jda.2016.03.002","volume":"37","author":"C Vroland","year":"2016","unstructured":"Vroland, C., Salson, M., Bini, S., Touzet, H.: Approximate search of short patterns with high error rates using the 01*0 lossless seeds. J. Discrete Algorithms 37, 3\u201316 (2016). https:\/\/doi.org\/10.1016\/j.jda.2016.03.002","journal-title":"J. Discrete Algorithms"}],"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-1-0716-3989-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T08:03:40Z","timestamp":1715846620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-0716-3989-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9781071639887","9781071639894"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-0716-3989-4_11","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":"17 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Cambridge, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"29 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 May 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":"recomb2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb.org\/recomb2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}