Bibliographic Details
| Title: |
Approximate Cartesian tree pattern matching. |
| Authors: |
Kim, Sungmin1 (AUTHOR) rena_rio@yonsei.ac.kr, Han, Yo-Sub1 (AUTHOR) emmous@yonsei.ac.kr |
| Source: |
Theoretical Computer Science. Nov2025, Vol. 1056, pN.PAG-N.PAG. 1p. |
| Subjects: |
Pattern matching, Polynomial time algorithms, Hamming distance, Cost functions, Matching theory, Data structures, Mathematical convolutions |
| Abstract: |
The Cartesian tree of a string is a binary tree, which is useful in capturing minimalities within strings. We study the approximate pattern matching problem for two Cartesian trees of two strings. We design a polynomial-time algorithm that computes the minimum edit cost when a given string is edited to match the Cartesian tree of the other string. We also design a linear-time algorithm that computes the (max,min)-convolution between two sorted arrays, which we use to speed up the algorithm computing the edit cost. Then, we adapt the algorithm that computes the edit cost to the approximate pattern matching problem, where we find all substrings of a given text that match a given Cartesian tree pattern within a given number of edit operations. We also consider variant problems such as the approximate Cartesian matching under Hamming distance, and present polynomial-time algorithms for the considered problems. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
