{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:29:04Z","timestamp":1774333744005,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_9","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:10Z","timestamp":1770977230000},"page":"125-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cartesian Forest Matching"],"prefix":"10.1007","author":[{"given":"Bastien","family":"Auvray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Groult","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s42979-024-02679-7","volume":"5","author":"O Amir","year":"2024","unstructured":"Amir, O., Amir, A., Fraenkel, A., Sarne, D.: On the practical power of automata in pattern matching. SN Comput. Sci. 5(4), 400 (2024)","journal-title":"SN Comput. Sci."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Auvray, B., David, J., Ghazawi, S., Groult, R., Landau, G.M., Lecroq, T.: Approximate Cartesian Tree matching with one difference (2025). https:\/\/arxiv.org\/abs\/2505.09236. Submitted at TCS, Under revision","DOI":"10.2139\/ssrn.5264110"},{"issue":"03","key":"9_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1142\/S1793830911001280","volume":"3","author":"M Bouvel","year":"2011","unstructured":"Bouvel, M., Chauve, C., Mishna, M., Rossin, D.: Average-case analysis of perfect sorting by reversals. Discret. Math. Algorithms Appl. 3(03), 369\u2013392 (2011)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"David, J.: Random Generation of Source Vectors with a fixed determining property (2023). https:\/\/hal.science\/hal-04616899. Submitted at TCS, Under revision","DOI":"10.2139\/ssrn.4669248"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00453-012-9683-x","volume":"68","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Landau, G.M., Weimann, O.: On Cartesian Trees and range minimum queries. Algorithmica 68(3), 610\u2013625 (2014)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR7","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":"9_CR8","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511801655"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Funakoshi, M., Mieno, T., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing maximal palindromes in non-standard matching models. In: IWOCA, pp. 165\u2013179 (2024)","DOI":"10.1007\/978-3-031-63021-7_13"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"9_CR11","unstructured":"Gawrychowski, P., Ghazawi, S., Landau, G.M.: On indeterminate strings matching. In: CPM, pp. 14:1\u201314:14 (2020)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Kikuchi, N., Hendrian, D., Yoshinaka, R., Shinohara, A.: Computing covers under substring consistent equivalence relations. In: SPIRE, pp. 131\u2013146 (2020)","DOI":"10.1007\/978-3-030-59212-7_10"},{"key":"9_CR13","unstructured":"Kim, S., Cho, H.: A compact index for Cartesian Tree matching. In: CPM, pp. 18:1\u201318:19 (2021)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kim, S., Han, Y.: Approximate Cartesian Tree pattern matching. In: DLT, pp. 189\u2013202 (2024)","DOI":"10.1007\/978-3-031-66159-4_14"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Jr., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(1), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Nishimoto, A., Fujisato, N., Nakashima, Y., Inenaga, S.: Position heaps for Cartesian-Tree matching on strings and tries. In: SPIRE, pp. 241\u2013254 (2021)","DOI":"10.1007\/978-3-030-86692-1_20"},{"key":"9_CR17","unstructured":"Oizumi, T., Kai, T., Mieno, T., Inenaga, S., Arimura, H.: Cartesian Tree subsequence matching. In: CPM, pp. 14:1\u201314:18 (2022)"},{"key":"9_CR18","unstructured":"Osterkamp, E.M., K\u00f6ppl, D.: Extending the Burrows-Wheeler transform for Cartesian Tree matching and constructing it. In: CPM, pp. 26:1\u201326:17 (2025)"},{"key":"9_CR19","unstructured":"Park, S., Amir, A., Landau, G., Park, K.: Cartesian Tree matching and indexing. In: CPM, pp. 1\u201314 (2019)"},{"key":"9_CR20","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":"9_CR21","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, S., 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."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Tsujimoto, T., Shibata, H., Mieno, T., Nakashima, Y., Inenaga, S.: Computing longest common subsequence under Cartesian-Tree matching model. In: IWOCA, pp. 369\u2013381 (2024)","DOI":"10.1007\/978-3-031-63021-7_28"},{"issue":"4","key":"9_CR23","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","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:08:32Z","timestamp":1774325312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","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 Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}