Computing longest common subsequence under Cartesian-tree matching model

DOI10.1007/978-3-031-63021-7_28MaRDI QIDQ7021081zbMATH OpenFDO

Authors Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_28

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 3340123 (Why is no real title available?)
• A fast algorithm for computing longest common subsequences
• A faster algorithm computing string edit distances
• A linear time algorithm for consecutive permutation pattern matching
• A longest common subsequence algorithm suitable for similar text strings
• Cartesian tree subsequence matching
• Computing the longest common subsequence of two run-length encoded strings
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Fast linear-space computations of longest common subsequences
• Finding patterns and periods in Cartesian tree matching
• On Indeterminate Strings Matching.
• Order-preserving indexing
• Order-preserving matching
• Pattern Matching in Trees
• Pattern matching for permutations
• Quadratic conditional lower bounds for string problems and dynamic time warping
• Tight hardness results for LCS and other sequence similarity measures

Cited in

(4)

• Subsequence matching and LCS under Cartesian-tree equivalence
• On the complexity of indeterminate strings matching
• Approximate Cartesian tree pattern matching
• Approximate Cartesian tree matching with one difference

This page was built for publication: Computing longest common subsequence under Cartesian-tree matching model

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