Fast multiple pattern Cartesian tree matching

DOI10.1007/978-3-030-39881-1_10MaRDI QIDQ782168zbMATH OpenOpenAlexFDO

Authors Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park

Publication date 22 July 2020

Full work available at URL https://arxiv.org/abs/1911.01644

zbMATH Keywords

binary encodingfingerprinting methodsmultiple pattern Cartesian tree matchingparent-distance encoding

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

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

Cited in

(6)

• Accelerating feature-vector matching using multiple-tree and sub-vector methods
• Approximate Cartesian tree matching: an approach using swaps
• Parallel tree pattern matching
• More efficient bottom-up multi-pattern matching in trees
• Fast Cartesian tree matching
• scientific article; zbMATH DE number 2079422 (Why is no real title available?)

This page was built for publication: Fast multiple pattern Cartesian tree matching

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