Position heaps for Cartesian-tree matching on strings and tries

DOI10.1007/978-3-030-86692-1_20MaRDI QIDQ2146147zbMATH OpenOpenAlexFDO

Authors Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga

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

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

Cited in

(8)

• Approximate Cartesian tree matching: an approach using swaps
• Approximate Cartesian tree pattern matching
• Computing maximal palindromes in non-standard matching models
• Computing maximal palindromes in non-standard matching models
• Approximate Cartesian tree pattern matching
• The ceBWT index: an index for circular Cartesian tree matching on multiple texts
• Approximate Cartesian tree matching with one difference
• Extending the Burrows-Wheeler transform for Cartesian tree matching and constructing it

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)