{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T23:24:18Z","timestamp":1775949858937,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031661587","type":"print"},{"value":"9783031661594","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_14","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"189-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Cartesian Tree Pattern Matching"],"prefix":"10.1007","author":[{"given":"Sungmin","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Auvray, B., David, J., Groult, R., Lecroq, T.: Approximate Cartesian tree matching: an approach using swaps. In: Proceedings of the 30th International Symposium on String Processing and Information Retrieval, pp. 49\u201361 (2023)","DOI":"10.1007\/978-3-031-43980-3_5"},{"key":"14_CR2","unstructured":"Biedl, T., et al.: Rollercoasters and caterpillars. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, pp. 18:1\u201318:15 (2018)"},{"issue":"1\u20133","key":"14_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoret. Comput. Sci. 337(1\u20133), 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ipl.2014.10.018","volume":"115","author":"S Cho","year":"2015","unstructured":"Cho, S., Na, J.C., Park, K., Sim, J.S.: A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115, 397\u2013402 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1093\/comjnl\/bxab204","volume":"66","author":"S Faro","year":"2023","unstructured":"Faro, S., Lecroq, T., Park, K., Scafiti, S.: On the longest common Cartesian substring problem. Comput. J. 66(4), 907\u2013923 (2023)","journal-title":"Comput. J."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1007\/s00453-021-00908-6","volume":"84","author":"P Gawrychowski","year":"2022","unstructured":"Gawrychowski, P., Manea, F., Serafin, R.: Fast and longest rollercoasters. Algorithmica 84(4), 1081\u20131106 (2022)","journal-title":"Algorithmica"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2015.08.022","volume":"638","author":"P Gawrychowski","year":"2016","unstructured":"Gawrychowski, P., Uzna\u0144ski, P.: Order-preserving pattern matching with $$k$$ mismatches. Theoret. Comput. Sci. 638, 136\u2013144 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2013.10.006","volume":"525","author":"J Kim","year":"2014","unstructured":"Kim, J., et al.: Order-preserving matching. Theoret. Comput. Sci. 525, 68\u201379 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR10","unstructured":"Kim, S., Cho, H.: A compact index for Cartesian tree matching. In: Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, pp. 18:1\u201318:19 (2021)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th Annual European Symposium on Algorithms, pp. 91\u2013102 (1998)","DOI":"10.1007\/3-540-68530-8_8"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Nishimoto, A., Fujisato, N., Nakashima, Y., Inenaga, S.: Position heaps for Cartesian-tree matching on strings and tries. In: Proceedings of the 28th International Symposium on String Processing and Information Retrieval, pp. 241\u2013254 (2021)","DOI":"10.1007\/978-3-030-86692-1_20"},{"key":"14_CR13","unstructured":"Oizumi, T., Kai, T., Mieno, T., Inenaga, S., Arimura, H.: Cartesian tree subsequence matching. In: Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, pp. 14:1\u201314:18 (2022)"},{"key":"14_CR14","unstructured":"Park, S.G., Amir, A., Landau, G.M., Park, K.: Cartesian tree matching and indexing. In: Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, pp. 16:1\u201316:14 (2019)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2020.09.014","volume":"845","author":"SG Park","year":"2020","unstructured":"Park, S.G., Bataa, M., Amir, A., Landau, G.M., Park, K.: Finding patterns and periods in Cartesian tree matching. Theoret. Comput. Sci. 845, 181\u2013197 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR16","unstructured":"Sakai, I.: Syntax in universal translation. In: Proceedings of the International Conference on Machine Translation and Applied Language Analysis, pp. 594\u2013608 (1961)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","volume":"13","author":"C Schensted","year":"1961","unstructured":"Schensted, C.: Longest increasing and decreasing subsequences. Can. J. Math. 13, 179\u2013191 (1961)","journal-title":"Can. J. Math."},{"key":"14_CR18","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edition. Cengage Learning (2012)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2020.10.009","volume":"849","author":"S Song","year":"2021","unstructured":"Song, S., Gu, G., Ryu, C., Faro, F., Lecroq, T., Park, K.: Fast algorithms for single and multiple pattern Cartesian tree matching. Theoret. Comput. Sci. 849, 47\u201363 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commun. ACM 23(4), 229\u2013239 (1980)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66159-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:03:38Z","timestamp":1729325018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}