{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:49:02Z","timestamp":1743133742175,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_8","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Prefix Fr\u00e9chet Similarity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3471-2706","authenticated-orcid":false,"given":"Christian","family":"Scheffer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"8_CR2","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30\u2013September 2 2005, pp. 853\u2013864 (2005)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J.: Detecting single file movement. In: Proceedings of 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, 5\u20137 November 2008, Irvine, California, USA, p. 33 (2008)","DOI":"10.1145\/1463434.1463476"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00454-016-9800-8","volume":"56","author":"K Buchin","year":"2016","unstructured":"Buchin, K., Buchin, M., van Leusden, R., Meulemans, W., Mulzer, W.: Computing the Fr\u00e9chet distance with a retractable leash. Discrete Comput. Geom. 56(2), 315\u2013336 (2016)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4\u20136 January 2009, pp. 645\u2013654 (2009)","DOI":"10.1137\/1.9781611973068.71"},{"key":"8_CR6","unstructured":"Buchin, M.: On the computability of the Fr\u00e9chet distance between triangulated surfaces. Ph.D. thesis, Department of Computer Science, Freie Universit\u00e4t, Berlin (2007)"},{"issue":"5","key":"8_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.comgeo.2014.01.002","volume":"47","author":"JD Carufel","year":"2014","unstructured":"Carufel, J.D., Gheibi, A., Maheshwari, A., Sack, J., Scheffer, C.: Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5), 625\u2013641 (2014)","journal-title":"Comput. Geom."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Gheibi, A., Maheshwari, A., Sack, J., Scheffer, C.: Minimum backward Fr\u00e9chet distance. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Dallas\/Fort Worth, TX, USA, 4\u20137 November 2014, pp. 381\u2013388 (2014)","DOI":"10.1145\/2666310.2666418"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compenvurbsys.2013.09.004","volume":"47","author":"J Gudmundsson","year":"2014","unstructured":"Gudmundsson, J., Wolle, T.: Football analysis using spatio-temporal tools. Comput. Environ. Urban Syst. 47, 16\u201327 (2014)","journal-title":"Comput. Environ. Urban Syst."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Keogh, E.J., Pazzani, M.J.: Scaling up dynamic time warping for datamining applications. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, 20\u201323 August 2000, pp. 285\u2013289 (2000)","DOI":"10.1145\/347090.347153"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Kim, M., Kim, S., Shin, M.: Optimization of subsequence matching under time warping in time-series databases. In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, 13\u201317 March 2005, pp. 581\u2013586 (2005)","DOI":"10.1145\/1066677.1066814"},{"key":"8_CR12","unstructured":"Maheshwari, A., Sack, J., Scheffer, C.: Approximating the integral Fr\u00e9chet distance. In: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, 22\u201324 June 2016, Reykjavik, Iceland, pp. 26:1\u201326:14 (2016)"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.comgeo.2010.09.008","volume":"44","author":"A Maheshwari","year":"2011","unstructured":"Maheshwari, A., Sack, J., Shahbaz, K., Zarrabi-Zadeh, H.: Fr\u00e9chet distance with speed limits. Comput. Geom. 44(2), 110\u2013120 (2011)","journal-title":"Comput. Geom."},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-013-9758-3","volume":"69","author":"A Maheshwari","year":"2014","unstructured":"Maheshwari, A., Sack, J., Shahbaz, K., Zarrabi-Zadeh, H.: Improved algorithms for partial curve matching. Algorithmica 69(3), 641\u2013657 (2014)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1142\/S0218195916500023","volume":"26","author":"C Scheffer","year":"2016","unstructured":"Scheffer, C.: More flexible curve matching via the partial Fr\u00e9chet similarity. Int. J. Comput. Geom. Appl. 26(1), 33\u201352 (2016)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:50:31Z","timestamp":1709823031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","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":"100","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":"30","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":"30% - 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":"9.8","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)"}}]}}