{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:05:45Z","timestamp":1773270345932,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031078019","type":"print"},{"value":"9783031078026","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07802-6_36","type":"book-chapter","created":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T11:04:18Z","timestamp":1654599858000},"page":"419-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximate Pattern Matching Using Search Schemes and\u00a0In-Text Verification"],"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-9994-8269","authenticated-orcid":false,"given":"Jan","family":"Fostier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,8]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53\u201386 (2004). https:\/\/doi.org\/10.1016\/S1570-8667(03)00065-0","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"36_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":"36_CR3","unstructured":"Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Technical report, Digital Systems Research Center (1994)"},{"key":"36_CR4","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 390\u2013398, February 2000. https:\/\/doi.org\/10.1109\/SFCS.2000.892127","DOI":"10.1109\/SFCS.2000.892127"},{"key":"36_CR5","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"36_CR6","first-page":"29","volume":"10","author":"H Hyyr\u00f6","year":"2003","unstructured":"Hyyr\u00f6, H.: A bit-vector algorithm for computing Levenshtein and Damerau edit distances. Nord. J. Comput. 10(1), 29\u201339 (2003)","journal-title":"Nord. J. Comput."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-45452-7_18","volume-title":"Combinatorial Pattern Matching","author":"H Hyyr\u00f6","year":"2002","unstructured":"Hyyr\u00f6, H., Navarro, G.: Faster bit-parallel approximate string matching. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 203\u2013224. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45452-7_18"},{"issue":"4","key":"36_CR8","first-page":"656","volume":"12","author":"WJ Kent","year":"2002","unstructured":"Kent, W.J.: BLAT - the BLAST-like alignment tool. Genome Res. 12(4), 656\u201364 (2002)","journal-title":"Genome Res."},{"key":"36_CR9","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":"36_CR10","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":"36_CR11","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, pp. 31\u201336, December 2009. https:\/\/doi.org\/10.1109\/BIBM.2009.42","DOI":"10.1109\/BIBM.2009.42"},{"issue":"14","key":"36_CR12","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"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45123-4_27","volume-title":"Combinatorial Pattern Matching","author":"MG Maa\u00df","year":"2000","unstructured":"Maa\u00df, M.G.: Linear bidirectional on-line construction of affix trees. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 320\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45123-4_27"},{"key":"36_CR14","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. Methods 9(12), 1185\u20131188 (2012). https:\/\/doi.org\/10.1028\/nmeth.2221","DOI":"10.1028\/nmeth.2221"},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0030777","volume-title":"Combinatorial Pattern Matching","author":"G Myers","year":"1998","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 1\u201313. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0030777"},{"key":"36_CR17","doi-asserted-by":"publisher","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001). https:\/\/doi.org\/10.1145\/375360.375365","DOI":"10.1145\/375360.375365"},{"issue":"1","key":"36_CR18","first-page":"205","volume":"1","author":"G Navarro","year":"2000","unstructured":"Navarro, G., Baeza-Yates, R.: A hybrid indexing method for approximate string matching. J. Discrete Algorithms 1(1), 205\u2013239 (2000)","journal-title":"J. Discrete Algorithms"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Pockrandt, C., Ehrhardt, M., Reinert, K.: EPR-dictionaries: a practical and fast data structure for constant time searches in unidirectional and bidirectional FM-indices (2016)","DOI":"10.1007\/978-3-319-56970-3_12"},{"key":"36_CR20","doi-asserted-by":"publisher","unstructured":"Pockrandt, C.M.: Approximate string matching: improving data structures and algorithms. Ph.D. thesis, Freien Universit\u00e4t Berlin (2019). https:\/\/doi.org\/10.17169\/refubium-2185","DOI":"10.17169\/refubium-2185"},{"key":"36_CR21","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":"36_CR22","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":"36_CR23","unstructured":"Siragusa, E.: Approximate string matching for high-throughput sequencing. Ph.D. thesis (2015)"},{"issue":"1","key":"36_CR24","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.tcs.2007.09.029","volume":"389","author":"D Strothmann","year":"2007","unstructured":"Strothmann, D.: The affix array data structure and its applications to RNA secondary structure analysis. Theoret. Comput. Sci. 389(1), 278\u2013294 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.029","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"36_CR25","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/bf01074755","volume":"4","author":"TK Vintsyuk","year":"1968","unstructured":"Vintsyuk, T.K.: Speech discrimination by dynamic programming. Cybernetics 4(1), 52\u201357 (1968). https:\/\/doi.org\/10.1007\/bf01074755","journal-title":"Cybernetics"},{"key":"36_CR26","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","Bioinformatics and Biomedical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07802-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T23:11:30Z","timestamp":1655680290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07802-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031078019","9783031078026"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07802-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWBBIO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Work-Conference on Bioinformatics and Biomedical Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gran Canaria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwbbio2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwbbio.ugr.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"212","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":"75","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":"35% - 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,1","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}