{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:11Z","timestamp":1758585611503,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052278","type":"print"},{"value":"9783032052285","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05228-5_23","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:22Z","timestamp":1758474082000},"page":"291-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Algorithm for\u00a0Bounded Damerau\u2013Levenshtein Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1683-5179","authenticated-orcid":false,"given":"Ryosuke","family":"Yamano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1514-5766","authenticated-orcid":false,"given":"Tetsuo","family":"Shibuya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01840365","volume":"2","author":"A Apostolico","year":"1987","unstructured":"Apostolico, A., Guerra, C.: The longest common subsequence problem revisited. Algorithmica 2, 315\u2013336 (1987). https:\/\/doi.org\/10.1007\/BF01840365","journal-title":"Algorithmica"},{"key":"23_CR2","unstructured":"Bard, G.V.: Spelling-error tolerant, order-independent pass-phrases via the Damerau-Levenshtein string-edit distance metric. Cryptology ePrint Archive (2006). https:\/\/eprint.iacr.org\/2006\/364"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Biswas, A.K., Gao, J.X.: PR2S2CLUST: patched RNA-SEQ read segments\u2019 structure-oriented clustering. J. Bioinform. Comput. Biol. 14(05), 1650027 (2016). https:\/\/doi.org\/10.1142\/S021972001650027X, pMID: 27455882","DOI":"10.1142\/S021972001650027X"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Boytsov, L.: Indexing methods for approximate dictionary searching: comparative analysis. ACM J. Exp. Algorithmics 16 (2011). https:\/\/doi.org\/10.1145\/1963190.1963191","DOI":"10.1145\/1963190.1963191"},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"Brill, E., Moore, R.C.: An improved error model for noisy channel spelling correction. In: Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics, pp. 286\u2013293. Association for Computational Linguistics, Hong Kong (2000). https:\/\/doi.org\/10.3115\/1075218.1075255, https:\/\/aclanthology.org\/P00-1037\/","DOI":"10.3115\/1075218.1075255"},{"key":"23_CR6","doi-asserted-by":"publisher","unstructured":"Cai, X., Zhang, X.C., Joshi, B., Johnson, R.: Touching from a distance: website fingerprinting attacks and defenses. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 605\u2013616. CCS 2012, Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2382196.2382260","DOI":"10.1145\/2382196.2382260"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"FJ Damerau","year":"1964","unstructured":"Damerau, F.J.: A technique for computer detection and correction of spelling errors. Commun. ACM 7(3), 171\u2013176 (1964). https:\/\/doi.org\/10.1145\/363958.363994","journal-title":"Commun. ACM"},{"issue":"6","key":"23_CR8","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM 47(6), 987\u20131011 (2000). https:\/\/doi.org\/10.1145\/355541.355547","journal-title":"J. ACM"},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"2550","DOI":"10.1109\/TIT.2017.2778143","volume":"64","author":"R Gabrys","year":"2018","unstructured":"Gabrys, R., Yaakobi, E., Milenkovic, O.: Codes in the Damerau distance for deletion and adjacent transposition correction. IEEE Trans. Inf. Theory 64(4), 2550\u20132570 (2018). https:\/\/doi.org\/10.1109\/TIT.2017.2778143","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"23_CR10","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. Nordic J. Comput. 10(1), 29\u201339 (2003)","journal-title":"Nordic J. Comput."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A. (ed.) Combinatorial Pattern Matching, pp. 181\u2013192. Springer, Berlin Heidelberg, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48194-X_17"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"GM Landau","year":"1988","unstructured":"Landau, G.M., Vishkin, U.: Fast string matching with k differences. J. Comput. Syst. Sci. 37(1), 63\u201378 (1988). https:\/\/doi.org\/10.1016\/0022-0000(88)90045-1","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR13","unstructured":"Levenshtein, V.I., et\u00a0al.: Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet Physics Doklady, vol.\u00a010, pp. 707\u2013710. Soviet Union (1966)"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Li, M., Zhu, M., Zhang, Y., Zhou, M.: Exploring distributional similarity based models for query spelling correction. In: Calzolari, N., Cardie, C., Isabelle, P. (eds.) Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pp. 1025\u20131032. Association for Computational Linguistics, Sydney, Australia (2006). https:\/\/doi.org\/10.3115\/1220175.1220304, https:\/\/aclanthology.org\/P06-1129\/","DOI":"10.3115\/1220175.1220304"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Majorek, K.A., et al.: The RNASE h-like superfamily: new members, comparative structural analysis and evolutionary classification. Nucleic Acids Res. 42(7), 4160\u20134179 (2014). https:\/\/doi.org\/10.1093\/nar\/gkt1414","DOI":"10.1093\/nar\/gkt1414"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"EW Myers","year":"1986","unstructured":"Myers, E.W.: AnO(ND) difference algorithm and its variations. Algorithmica 1(1), 251\u2013266 (1986). https:\/\/doi.org\/10.1007\/BF01840446","journal-title":"Algorithmica"},{"key":"23_CR17","unstructured":"National Center for Biotechnology Information (NCBI): NCBI Datasets (2025). https:\/\/www.ncbi.nlm.nih.gov\/datasets\/. Accessed 3 June"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48(3), 443\u2013453 (1970). https:\/\/doi.org\/10.1016\/0022-2836(70)90057-4","journal-title":"J. Mol. Biol."},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear suffix array construction by almost pure induced-sorting. In: 2009 Data Compression Conference, pp. 193\u2013202 (2009). https:\/\/doi.org\/10.1109\/DCC.2009.42","DOI":"10.1109\/DCC.2009.42"},{"issue":"5","key":"23_CR20","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0031-3203(96)00101-X","volume":"30","author":"B Oommen","year":"1997","unstructured":"Oommen, B., Loke, R.: Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions. Pattern Recogn. 30(5), 789\u2013800 (1997). https:\/\/doi.org\/10.1016\/S0031-3203(96)00101-X","journal-title":"Pattern Recogn."},{"key":"23_CR21","volume-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1983","unstructured":"Sankoff, D., Kruskal, J.B. (eds.): Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA (1983)"},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Ukkonen, E.: Algorithms for approximate string matching. Inf. Control 64(1), 100\u2013118 (1985). https:\/\/doi.org\/10.1016\/S0019-9958(85)80046-2 international Conference on Foundations of Computation Theory","DOI":"10.1016\/S0019-9958(85)80046-2"},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/321879.321880","volume":"22","author":"RA Wagner","year":"1975","unstructured":"Wagner, R.A., Lowrance, R.: An extension of the string-to-string correction problem. J. ACM 22(2), 177\u2013183 (1975). https:\/\/doi.org\/10.1145\/321879.321880","journal-title":"J. ACM"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-019-2819-0","volume":"20","author":"C Zhao","year":"2019","unstructured":"Zhao, C., Sahni, S.: String correction using the Damerau-Levenshtein distance. BMC Bioinform. 20, 1\u201328 (2019). https:\/\/doi.org\/10.1186\/s12859-019-2819-0","journal-title":"BMC Bioinform."},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-019-3184-8","volume":"21","author":"C Zhao","year":"2020","unstructured":"Zhao, C., Sahni, S.: Linear space string correction algorithm using the Damerau-Levenshtein distance. BMC Bioinform. 21, 1\u201321 (2020). https:\/\/doi.org\/10.1186\/s12859-019-3184-8","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05228-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:23Z","timestamp":1758474083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}