Cartesian tree subsequence matching

DOI10.4230/LIPICS.CPM.2022.14MaRDI QIDQ6496842zbMATH OpenFDO

Authors Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura

Publication date 6 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2022.14

zbMATH Keywords

Cartesian tree subsequence matchingepisode matchingorder preserving matchingpattern matchingstring algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(10)

• Approximate Cartesian tree matching: an approach using swaps
• Approximate Cartesian tree pattern matching
• Computing maximal palindromes in non-standard matching models
• Computing longest common subsequence under Cartesian-tree matching model
• Computing maximal palindromes in non-standard matching models
• Approximate Cartesian tree pattern matching
• Subsequence matching and LCS under Cartesian-tree equivalence
• 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: Cartesian tree subsequence matching

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