{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:03:56Z","timestamp":1776114236044,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030004781","type":"print"},{"value":"9783030004798","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00479-8_5","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T14:58:18Z","timestamp":1536850698000},"page":"50-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive Computation of the Discrete Fr\u00e9chet Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3392-8353","authenticated-orcid":false,"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings of the 11th Symposium on String Processing and Information Retrieval (SPIRE), pp. 39\u201348 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bringmann, K.: Why walking the dog takes time: Fr\u00e9chet distance has no strongly subquadratic algorithms unless SETH fails. In: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, FOCS 2014, pp. 661\u2013670. IEEE Computer Society, Washington, DC (2014)","DOI":"10.1109\/FOCS.2014.76"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00454-002-2886-1","volume":"28","author":"A Efrat","year":"2002","unstructured":"Efrat, A., Guibas, L., Har-Peled, S., Mitchell, J., Murali, T.: New similarity measures between polylines with applications to morphing and polygon sweeping. Discret. Comput. Geom. 28(4), 535\u2013569 (2002)","journal-title":"Discret. Comput. Geom."},{"key":"5_CR4","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical report, Christian Doppler Labor f\u00fcr Expertensyteme, Technische Universit\u00e4t Wien (1994)"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Comput. Surv. (ACMCS) 24(4), 441\u2013476 (1992)","journal-title":"ACM Comput. Surv. (ACMCS)"},{"key":"5_CR6","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag New York Inc., Secaucus (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1007\/978-0-387-35973-1_823","volume-title":"Encyclopedia of GIS","author":"J Gudmundsson","year":"2017","unstructured":"Gudmundsson, J., Laube, P., Wolle, T.: Movement patterns in spatio-temporal data. In: Shekhar, S., Xiong, H. (eds.) Encyclopedia of GIS, pp. 1362\u20131370. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-0-387-35973-1_823"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Mirzanezhad, M., Mohades, A., Wenk, C.: Fast Fr\u00e9chet distance between curves with long edges. In: Proceedings of the International Workshop on Interactive and Spatial Computing (WISC), IWISC 2018, pp. 52\u201358. ACM, New York (2018). Best Paper Award IWISC\u201918","DOI":"10.1145\/3191801.3191811"},{"issue":"1\u20132","key":"5_CR9","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. (IJCGA) 5(1\u20132), 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl. (IJCGA)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/S0219720008003278","volume":"6","author":"M Jiang","year":"2008","unstructured":"Jiang, M., Xu, Y., Zhu, B.: Protein structure-structure alignment with discrete Fr\u00e9chet distance. J. Bioinform. Comput. Biol. 6(1), 51\u201364 (2008)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Marx, D.: Parameterized complexity of constraint satisfaction problems. In: Proceedings of 19th Annual IEEE Conference on Computational Complexity (CCC), pp. 139\u2013149 (2004)","DOI":"10.1109\/CCC.2004.1313823"},{"issue":"2","key":"5_CR12","first-page":"70","volume":"24","author":"A Moffat","year":"1992","unstructured":"Moffat, A., Petersson, O.: An overview of adaptive sorting. Aust. Comput. J. (ACJ) 24(2), 70\u201377 (1992)","journal-title":"Aust. Comput. J. (ACJ)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"e1004568","DOI":"10.1371\/journal.pcbi.1004568","volume":"11","author":"SL Seyler","year":"2015","unstructured":"Seyler, S.L., Kumar, A., Thorpe, M.F., Beckstein, O.: Path similarity analysis: a method for quantifying macromolecular pathways. PLoS Comput. Biol. 11, e1004568 (2015)","journal-title":"PLoS Comput. Biol."},{"key":"5_CR14","unstructured":"Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fr\u00e9chet distance based approach for searching online handwritten documents. In: Proceedings of the Ninth International Conference on Document Analysis and Recognition, ICDAR 2007, vol. 01, pp. 461\u2013465. IEEE Computer Society, Washington, DC (2007). http:\/\/dl.acm.org\/citation.cfm?id=1304595.1304769"},{"key":"5_CR15","unstructured":"Wikipedia: Frechet$$\\_$$distance. https:\/\/en.wikipedia.org\/wiki\/Fr\u2019echet_distance"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00479-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T05:40:39Z","timestamp":1751866839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/eventos.spc.org.pe\/spire2018\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"43% - 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"}},{"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"}},{"value":"3.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}