Position heaps for Cartesian-tree matching on strings and tries

DOI10.1007/978-3-030-86692-1_20OpenAlexW3204952292MaRDI QIDQ2146147FDOQ2146147

Shunsuke Inenaga, Noriki Fujisato, Akio Nishimoto, Yuto Nakashima

Publication date: 15 June 2022

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

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• The level ancestor problem simplified
• Parameterized pattern matching: Algorithms and applications
• Order-preserving matching
• Title not available (Why is that?)
• Order-preserving indexing
• A fast algorithm for order-preserving pattern matching
• Position heaps: a simple and dynamic text indexing data structure
• Palindrome Pattern Matching
• Title not available (Why is that?)
• A theory of parameterized pattern matching
• File structures using hashing functions
• Improved dynamic dictionary matching
• Generalized pattern matching and periodicity under substring consistent equivalence relations
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Fast incremental planarity testing
• Finding patterns and periods in Cartesian tree matching
• The parameterized position heap of a trie

Cited In (1)

• Approximate Cartesian tree matching: an approach using swaps

This page was built for publication: Position heaps for Cartesian-tree matching on strings and tries

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