The merged longest common increasing subsequence problem

DOI10.1016/J.TCS.2025.115269MaRDI QIDQ6985814zbMATH OpenFDO

Authors Chien-Ting Lee, Chang-Biau Yang, Kuo-Si Huang

Publication date 12 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115269

zbMATH Keywords

dynamic programming algorithmlongest increasing subsequencediagonal algorithmmerged longest common subsequencemerged longest common increasing subsequence

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites work

• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.
• A diagonal-based algorithm for the longest common increasing subsequence problem
• A fast algorithm for computing a longest common increasing subsequence
• A fast algorithm for computing longest common subsequences
• A linear space algorithm for computing a longest common increasing subsequence
• A linear space algorithm for computing maximal common subsequences
• A longest common subsequence algorithm suitable for similar text strings
• Bit-parallel algorithms for the merged longest common subsequence problem
• Efficient algorithms for finding a longest common increasing subsequence
• Efficient algorithms for finding interleaving relationship between sequences
• Efficient merged longest common subsequence algorithms for similar sequences
• Faster Algorithms for Computing Longest Common Increasing Subsequences
• Faster algorithms for computing longest common increasing subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• The String-to-String Correction Problem

This page was built for publication: The merged longest common increasing subsequence problem

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