{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:26:14Z","timestamp":1743143174423,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592110"},{"type":"electronic","value":"9783030592127"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59212-7_3","type":"book-chapter","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:05:34Z","timestamp":1600250734000},"page":"27-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Efficient Interactive Computation of Dynamic Time Warping Distance"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Nishi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6269-9353","authenticated-orcid":false,"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6138-1607","authenticated-orcid":false,"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Backurs, A., Williams, V.V.: Tight hardness results for LCS and other sequence similarity measures. In: FOCS 2015, pp. 59\u201378 (2015)","DOI":"10.1109\/FOCS.2015.14"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bringmann, K., K\u00fcnnemann, M.: Quadratic conditional lower bounds for string problems and dynamic time warping. In: FOCS 2015, pp. 79\u201397 (2015)","DOI":"10.1109\/FOCS.2015.15"},{"key":"3_CR3","unstructured":"Charalampopoulos, P., Kociumaka, T., Mozes, S.: Dynamic string alignment. In: CPM 2020, pp. 9:1\u20139:13 (2020)"},{"key":"3_CR4","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 (2020)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-662-49192-8_25","volume-title":"SOFSEM 2016: Theory and Practice of Computer Science","author":"H Hyyr\u00f6","year":"2016","unstructured":"Hyyr\u00f6, H., Inenaga, S.: Compacting a dynamic edit distance table by RLE compression. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 302\u2013313. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49192-8_25"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0129054118410083","volume":"29","author":"H Hyyr\u00f6","year":"2018","unstructured":"Hyyr\u00f6, H., Inenaga, S.: Dynamic RLE-compressed edit distance tables under general weighted cost functions. Int. J. Found. Comput. Sci. 29(4), 623\u2013645 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-11266-9_43","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"H Hyyr\u00f6","year":"2010","unstructured":"Hyyr\u00f6, H., Narisawa, K., Inenaga, S.: Dynamic edit distance table under a general weighted cost function. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 515\u2013527. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-11266-9_43"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2015.05.007","volume":"34","author":"H Hyyr\u00f6","year":"2015","unstructured":"Hyyr\u00f6, H., Narisawa, K., Inenaga, S.: Dynamic edit distance table under a general weighted cost function. J. Discret. Algorithms 34, 2\u201317 (2015)","journal-title":"J. Discret. Algorithms"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S1570-8667(03)00082-0","volume":"2","author":"SR Kim","year":"2004","unstructured":"Kim, S.R., Park, K.: A dynamic edit distance table. J. Discret. Algorithms 2, 302\u2013312 (2004)","journal-title":"J. Discret. Algorithms"},{"key":"3_CR10","unstructured":"Kuszmaul, W.: Dynamic time warping in strongly subquadratic time: algorithms for the low-distance regime and approximate evaluation. In: ICALP 2019, pp. 80:1\u201380:15 (2019)"},{"key":"3_CR11","unstructured":"Nishi, A., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Towards efficient interactive computation of dynamic time warping distance. CoRR abs\/2005.08190 (2020). \nhttps:\/\/arxiv.org\/abs\/2005.08190"},{"issue":"1","key":"3_CR12","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 Signal Process. 26(1), 43\u201349 (1978)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"JP Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application in finding all approximate repeats in strings. SIAM J. Comput. 27(4), 972\u2013992 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59212-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:06:28Z","timestamp":1600250788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59212-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592110","9783030592127"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59212-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 September 2020","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":"Orlando, FL","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ucf.edu\/spire2020\/","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":"32","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":"17","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":"4","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":"4","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":"2","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)"}}]}}