Fast Cartesian tree matching

DOI10.1007/978-3-030-32686-9_9zbMATH Open1539.68385MaRDI QIDQ6536248

Thierry Lecroq, Kunsoo Park, Cheol Ryu, Siwoo Song, Simone Faro

Publication date: 19 April 2024

zbMATH Keywords

Cartesian tree matchingglobal-parent representationfiltration algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• A linear time algorithm for consecutive permutation pattern matching
• A fast algorithm for order-preserving pattern matching
• A filtration method for order-preserving matching
• Improving practical exact string matching
• Alphabet dependence in parameterized matching
• Overlap matching.
• Approximate swapped matching.
• On representations of ternary order relations in numeric strings
• Order-preserving matching
• Algorithms for jumbled pattern matching in strings
• A unifying look at data structures
• Fast Pattern Matching in Strings
• Pattern Matching with Swaps
• Cartesian Tree Matching and Indexing
• A theory of parameterized pattern matching

This page was built for publication: Fast Cartesian tree matching

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