A diagonal-based algorithm for the longest common increasing subsequence problem
From MaRDI portal
Publication:2310745
DOI10.1016/j.tcs.2020.02.024zbMath1433.68634OpenAlexW3008749970MaRDI QIDQ2310745
Kuo-Tsung Tseng, Kuo-Si Huang, Chang-Biau Yang, Shou-Fu Lo
Publication date: 6 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.02.024
Related Items (2)
An efficient algorithm for the longest common palindromic subsequence problem ⋮ An efficient algorithm for enumerating longest common increasing subsequences
Uses Software
Cites Work
- Unnamed Item
- Enumerating longest increasing subsequences and patience sorting
- Faster algorithms for computing longest common increasing subsequences
- A fast algorithm for computing a longest common increasing subsequence
- A linear space algorithm for computing a longest common increasing subsequence
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
- Efficient algorithms for finding a longest common increasing subsequence
- A longest common subsequence algorithm suitable for similar text strings
- On computing the length of longest increasing subsequences
- Preserving order in a forest in less than logarithmic time and linear space
- Efficient merged longest common subsequence algorithms for similar sequences
- A linear algorithm for 3-letter longest common weakly increasing subsequence
- Fast computation of a longest increasing subsequence and application
- Finding the gapped longest common subsequence by incremental suffix maximum queries
- Longest Increasing and Decreasing Subsequences
- A linear space algorithm for computing maximal common subsequences
- A fast algorithm for computing longest common subsequences
- The String-to-String Correction Problem
- Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
- Faster Algorithms for Computing Longest Common Increasing Subsequences
This page was built for publication: A diagonal-based algorithm for the longest common increasing subsequence problem
