{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:19:02Z","timestamp":1743149942383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_29","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"351-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Chain Pair Simplification Problem"],"prefix":"10.1007","author":[{"given":"Chenglin","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omrit","family":"Filtser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/130920526","volume":"43","author":"PK Agarwal","year":"2014","unstructured":"Agarwal, P.K., Avraham, R.B., Kaplan, H., Sharir, M.: Computing the discrete Fr\u00e9chet distance in subquadratic time. SIAM J. Comput. 43(2), 429\u2013449 (2014)","journal-title":"SIAM J. Comput."},{"key":"29_CR2","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. Internat. J. Comput. Geometry Appl. 5, 75\u201391 (1995)","journal-title":"Internat. J. Comput. Geometry Appl."},{"doi-asserted-by":"crossref","unstructured":"Avraham, R.B., Filtser, O., Kaplan, H., Katz, M.J., Sharir, M.: The discrete Fr\u00e9chet distance with shortcuts via approximate distance counting and selection. In: Proc. 30th Annual ACM Sympos. on Computational Geometry, SOCG 2014, p. 377 (2014)","key":"29_CR3","DOI":"10.1145\/2582112.2582155"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-540-78773-0_54","volume-title":"LATIN 2008: Theoretical Informatics","author":"S Bereg","year":"2008","unstructured":"Bereg, S., Jiang, M., Wang, W., Yang, B., Zhu, B.: Simplifying 3d polygonal chains under the discrete Fr\u00e9chet distance. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 630\u2013641. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Meulemans, W., Mulzer, W.: Four soviets walk the dog \u2013 with an application to alt\u2019s conjecture. In: Proc. 25th Annual ACM-SIAM Sympos. on Discrete Algorithms, SODA 2014, pp. 1399\u20131413 (2014)","key":"29_CR5","DOI":"10.1137\/1.9781611973402.103"},{"issue":"5","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1137\/120865112","volume":"42","author":"A Driemel","year":"2013","unstructured":"Driemel, A., Har-Peled, S.: Jaywalking your dog: Computing the Fr\u00e9chet distance with shortcuts. SIAM J. Comput. 42(5), 1830\u20131866 (2013)","journal-title":"SIAM J. Comput."},{"unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical Report CD-TR 94\/64, Information Systems Dept., Technical University of Vienna (1994)","key":"29_CR7"},{"issue":"1","key":"29_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"M Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Matematico di Palermo 22(1), 1\u201372 (1906)","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"issue":"1","key":"29_CR9","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. Bioinformatics and Computational Biology 6(1), 51\u201364 (2008)","journal-title":"J. Bioinformatics and Computational Biology"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-21931-3_6","volume-title":"Computational Science and Its Applications - ICCSA 2011","author":"T Wylie","year":"2011","unstructured":"Wylie, T., Luo, J., Zhu, B.: A Practical solution for aligning and simplifying pairs of protein backbones under the discrete Fr\u00e9chet distance. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part III. LNCS, vol. 6784, pp. 74\u201383. Springer, Heidelberg (2011)"},{"issue":"6","key":"29_CR11","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1109\/TCBB.2013.17","volume":"10","author":"T Wylie","year":"2013","unstructured":"Wylie, T., Zhu, B.: Protein chain pair simplification under the discrete Fr\u00e9chet distance. IEEE\/ACM Trans. Comput. Biology Bioinform. 10(6), 1372\u20131383 (2013)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:46:52Z","timestamp":1676026012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}