Approximate Cartesian tree pattern matching

DOI10.1016/J.TCS.2025.115506MaRDI QIDQ6903546zbMATH OpenFDO

Authors Sung-Min Kim, Yo-Sub Han

Publication date 10 November 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115506

zbMATH Keywords

edit distanceapproximate pattern matchingCartesian trees

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• scientific article; zbMATH DE number 1305084 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• A Compact Index for Cartesian Tree Matching
• A fast algorithm for order-preserving pattern matching
• A survey on tree edit distance and related problems
• A unifying look at data structures
• Approximate Cartesian tree matching: an approach using swaps
• Approximate Cartesian tree pattern matching
• Cartesian Tree Matching and Indexing
• Cartesian tree subsequence matching
• Computing longest common subsequence under Cartesian-tree matching model
• Continuous and discrete time signals and systems
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Fast and longest rollercoasters
• Finding patterns and periods in Cartesian tree matching
• Longest Increasing and Decreasing Subsequences
• Order-preserving matching
• Order-preserving pattern matching with \(k\) mismatches
• Position heaps for Cartesian-tree matching on strings and tries
• Rollercoasters and caterpillars

Cited in

(1)

• Approximate Cartesian tree matching with one difference

This page was built for publication: Approximate Cartesian tree pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903546)