{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:44:44Z","timestamp":1750221884212,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206429"},{"type":"electronic","value":"9783031206436"}],"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-20643-6_23","type":"book-chapter","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:18:09Z","timestamp":1667222289000},"page":"315-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pattern Matching Under $$\\textrm{DTW}$$ Distance"],"prefix":"10.1007","author":[{"given":"Garance","family":"Gourdel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Driemel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Peterlongo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatiana","family":"Starikovskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Abboud, A., Backurs, A., Williams, V.V.: Tight hardness results for LCS and other sequence similarity measures. In: FOCS 2015, pp. 59\u201378. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.14","DOI":"10.1109\/FOCS.2015.14"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-020-1935-5","volume":"21","author":"SL Amarasinghe","year":"2020","unstructured":"Amarasinghe, S.L., Su, S., Dong, X., Zappia, L., Ritchie, M.E., Gouil, Q.: Opportunities and challenges in long-read sequencing data analysis. Genome Biol. 21(1), 1\u201316 (2020)","journal-title":"Genome Biol."},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. In: FOCS 2011, pp. 267\u2013276 (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.63","DOI":"10.1109\/FOCS.2011.63"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Braverman, V., Charikar, M., Kuszmaul, W., Woodruff, D.P., Yang, L.F.: The one-way communication complexity of dynamic time warping distance. In: SoCG 2019. LIPIcs, vol. 129, pp. 16:1\u201316:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.16","DOI":"10.4230\/LIPIcs.SoCG.2019.16"},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"Bringmann, K., K\u00fcnnemann, M.: Quadratic conditional lower bounds for string problems and dynamic time warping. In: FOCS 2015, pp. 79\u201397 (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.15","DOI":"10.1109\/FOCS.2015.15"},{"issue":"7","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1093\/molbev\/msp063","volume":"26","author":"JQ Chen","year":"2009","unstructured":"Chen, J.Q., Wu, Y., Yang, H., Bergelson, J., Kreitman, M., Tian, D.: Variation in the ratio of nucleotide substitution and indel rates across genomes in mammals and bacteria. Mol. Biol. Evol. 26(7), 1523\u20131531 (2009). https:\/\/doi.org\/10.1093\/molbev\/msp063","journal-title":"Mol. Biol. Evol."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Driemel, A., Silvestri, F.: Locality-sensitive hashing of curves. In: SoCG 2017. LIPIcs, vol. 77, pp. 37:1\u201337:16 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.37","DOI":"10.4230\/LIPIcs.SoCG.2017.37"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-44412-3_11","volume-title":"Advanced Analysis and Learning on Temporal Data","author":"M Dupont","year":"2016","unstructured":"Dupont, M., Marteau, P.-F.: Coarse-DTW for sparse time series alignment. In: Douzal-Chouakria, A., Vilar, J.A., Marteau, P.-F. (eds.) AALTD 2015. LNCS (LNAI), vol. 9785, pp. 157\u2013172. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44412-3_11"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Emiris, I.Z., Psarros, I.: Products of euclidean metrics and applications to proximity questions among curves. In: SoCG 2018. LIPIcs, vol. 99, pp. 37:1\u201337:13 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2018.37","DOI":"10.4230\/LIPIcs.SoCG.2018.37"},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC 2003, pp. 448\u2013455 (2003). https:\/\/doi.org\/10.1145\/780542.780608","DOI":"10.1145\/780542.780608"},{"key":"23_CR11","unstructured":"Froese, V., Jain, B.J., Rymar, M., Weller, M.: Fast exact dynamic time warping on run-length encoded time series. CoRR abs\/1903.03003 (2019)"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Gold, O., Sharir, M.: Dynamic time warping and geometric edit distance: breaking the quadratic barrier. ACM Trans. Algorithms 14(4), 50:1\u201350:17 (2018). https:\/\/doi.org\/10.1145\/3230734","DOI":"10.1145\/3230734"},{"key":"23_CR13","series-title":"Translational Bioinformatics","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-94-017-7450-5_6","volume-title":"Transcriptomics and Gene Regulation","author":"ML Gonzalez-Garay","year":"2016","unstructured":"Gonzalez-Garay, M.L.: Introduction to isoform sequencing using pacific biosciences technology (Iso-Seq). In: Wu, J. (ed.) Transcriptomics and Gene Regulation. TRBIO, vol. 9, pp. 141\u2013160. Springer, Dordrecht (2016). https:\/\/doi.org\/10.1007\/978-94-017-7450-5_6"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1186\/s13059-021-02282-6","volume":"22","author":"YT Huang","year":"2021","unstructured":"Huang, Y.T., Liu, P.Y., Shih, P.W.: Homopolish: a method for the removal of systematic errors in nanopore sequencing by homologous polishing. Genome Biol. 22(1), 95 (2021). https:\/\/doi.org\/10.1186\/s13059-021-02282-6","journal-title":"Genome Biol."},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-62416-7_12","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"Y Hwang","year":"2017","unstructured":"Hwang, Y., Gelfand, S.B.: Sparse dynamic time warping. In: Perner, P. (ed.) MLDM 2017. LNCS (LNAI), vol. 10358, pp. 163\u2013175. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62416-7_12"},{"key":"23_CR16","unstructured":"Hwang, Y., Gelfand, S.B.: Binary sparse dynamic time warping. In: MLDM 2019, pp. 748\u2013759. ibai Publishing (2019)"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Kuszmaul, W.: Dynamic time warping in strongly subquadratic time: algorithms for the low-distance regime and approximate evaluation. In: ICALP 2019. LIPIcs, vol. 132, pp. 80:1\u201380:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.80","DOI":"10.4230\/LIPIcs.ICALP.2019.80"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Kuszmaul, W.: Dynamic time warping in strongly subquadratic time: algorithms for the low-distance regime and approximate evaluation. CoRR abs\/1904.09690 (2019). https:\/\/doi.org\/10.48550\/ARXIV.1904.09690","DOI":"10.48550\/ARXIV.1904.09690"},{"key":"23_CR19","unstructured":"Kuszmaul, W.: Binary dynamic time warping in linear time. CoRR abs\/2101.01108 (2021)"},{"issue":"2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"GM Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557\u2013582 (1998). https:\/\/doi.org\/10.1137\/S0097539794264810","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR21","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."},{"issue":"18","key":"23_CR22","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). https:\/\/doi.org\/10.1093\/bioinformatics\/bty191","journal-title":"Bioinformatics"},{"issue":"1","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-019-1828-7","volume":"20","author":"M Mahmoud","year":"2019","unstructured":"Mahmoud, M., Gobet, N., Cruz-D\u00e1valos, D.I., Mounier, N., Dessimoz, C., Sedlazeck, F.J.: Structural variant calling: the long and the short of it. Genome Biol. 20(1), 1\u201314 (2019). https:\/\/doi.org\/10.1186\/s13059-019-1828-7","journal-title":"Genome Biol."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Mueen, A., Chavoshi, N., Abu-El-Rub, N., Hamooni, H., Minnich, A.: AWarp: fast warping distance for sparse time series. In: ICDM 2016, pp. 350\u2013359. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0046"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-59212-7_3","volume-title":"String Processing and Information Retrieval","author":"A Nishi","year":"2020","unstructured":"Nishi, A., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Towards efficient interactive computation of dynamic time warping distance. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. LNCS, vol. 12303, pp. 27\u201341. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_3"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Sakai, Y., Inenaga, S.: A reduction of the dynamic time warping distance to the longest increasing subsequence length. In: ISAAC 2020. LIPIcs, vol. 181, pp. 6:1\u20136:16 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2020.6","DOI":"10.4230\/LIPIcs.ISAAC.2020.6"},{"issue":"1","key":"23_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech Sig. Process. 26(1), 43\u201349 (1978)","journal-title":"IEEE Trans. Acoust. Speech Sig. Process."}],"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-031-20643-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:20:26Z","timestamp":1667222426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20643-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206429","9783031206436"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20643-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","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":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","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":"spire2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2022.inf.udec.cl\/","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":"43","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":"23","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":"53% - 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","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":"3.62","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}