Approximate Cartesian tree pattern matching.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 188943893 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Approximate Cartesian tree pattern matching. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Kim%2C+Sungmin%22">Kim, Sungmin</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> rena_rio@yonsei.ac.kr</i><br /><searchLink fieldCode="AR" term="%22Han%2C+Yo-Sub%22">Han, Yo-Sub</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> emmous@yonsei.ac.kr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Nov2025, Vol. 1056, pN.PAG-N.PAG. 1p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Pattern+matching%22">Pattern matching</searchLink><br /><searchLink fieldCode="DE" term="%22Polynomial+time+algorithms%22">Polynomial time algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Hamming+distance%22">Hamming distance</searchLink><br /><searchLink fieldCode="DE" term="%22Cost+functions%22">Cost functions</searchLink><br /><searchLink fieldCode="DE" term="%22Matching+theory%22">Matching theory</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+convolutions%22">Mathematical convolutions</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=188943893 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.tcs.2025.115506 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 1 StartPage: N.PAG Subjects: – SubjectFull: Pattern matching Type: general – SubjectFull: Polynomial time algorithms Type: general – SubjectFull: Hamming distance Type: general – SubjectFull: Cost functions Type: general – SubjectFull: Matching theory Type: general – SubjectFull: Data structures Type: general – SubjectFull: Mathematical convolutions Type: general Titles: – TitleFull: Approximate Cartesian tree pattern matching. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Kim, Sungmin – PersonEntity: Name: NameFull: Han, Yo-Sub IsPartOfRelationships: – BibEntity: Dates: – D: 21 M: 11 Text: Nov2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 03043975 Numbering: – Type: volume Value: 1056 Titles: – TitleFull: Theoretical Computer Science Type: main |
| ResultId | 1 |
