Computing a longest common almost-increasing subsequence of two sequences
From MaRDI portal
Publication:2220858
DOI10.1016/j.tcs.2020.11.035zbMath1478.68462OpenAlexW3105231663MaRDI QIDQ2220858
Chin Lung Lu, Yi-Kung Shieh, Toan Thang Ta
Publication date: 25 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.035
Related Items
Computing the longest common almost-increasing subsequence, Computing longest (common) Lyndon subsequences, Computing longest Lyndon subsequences and longest common Lyndon subsequences
Uses Software
Cites Work
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- The longest almost-increasing subsequence
- A fast algorithm for computing a longest common increasing subsequence
- Permutations, matrices, and generalized Young tableaux
- Longest Increasing and Decreasing Subsequences
- Algorithms for the Longest Common Subsequence Problem
- Algorithms on Strings, Trees and Sequences
- Tight Ω(nlgn) lower bound for finding a longest increasing subsequence
- The String-to-String Correction Problem
- Algorithms on Strings