Finding periods in Cartesian tree matching

DOI10.1007/978-3-030-25005-8_7MaRDI QIDQ2301735zbMATH OpenOpenAlexFDO

Authors Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_7

zbMATH Keywords

periodCartesian tree matchingparent-distance representation

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Finding patterns and periods in Cartesian tree matching
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Publication:3468609
• scientific article; zbMATH DE number 1615296
• Efficient detection of quasiperiodicities in strings

Cited in

(3)

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

This page was built for publication: Finding periods in Cartesian tree matching

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