Fast Cartesian tree matching

DOI10.1007/978-3-030-32686-9_9MaRDI QIDQ6536248zbMATH OpenFDO

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

Publication date 19 April 2024

zbMATH Keywords

Cartesian tree matchingglobal-parent representationfiltration algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Fast algorithms for single and multiple pattern Cartesian tree matching
• Fast multiple pattern Cartesian tree matching
• Cartesian Tree Matching and Indexing
• Finding patterns and periods in Cartesian tree matching
• Finding periods in Cartesian tree matching

Cites work

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

Cited in

(1)

• Approximate Cartesian tree matching: an approach using swaps

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)