Computing the longest common almost-increasing subsequence
From MaRDI portal
Publication:2166775
DOI10.1016/j.tcs.2022.07.021OpenAlexW4289596129WikidataQ126367391 ScholiaQ126367391MaRDI QIDQ2166775
Mohammad Tawhidul Hasan Bhuiyan, Muhammad Rashed Alam, M. Sohel Rahman
Publication date: 25 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.07.021
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- On the generalized constrained longest common subsequence problems
- Faster algorithms for computing longest common increasing subsequences
- A new efficient algorithm for computing the longest common subsequence
- A fast algorithm for computing a longest common increasing subsequence
- Algorithms for computing variants of the longest common subsequence problem
- New efficient algorithms for the LCS and constrained LCS problems
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
- The constrained longest common subsequence problem
- On computing the length of longest increasing subsequences
- Computing a longest common almost-increasing subsequence of two sequences
- Permutations, matrices, and generalized Young tableaux
- Longest Increasing and Decreasing Subsequences
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
- The Constrained Longest Common Subsequence Problem for Degenerate Strings
- Algorithms for Computing the Longest Parameterized Common Subsequence
- The Longest Almost-Increasing Subsequence
- Priority Search Trees
- Design and implementation of an efficient priority queue
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds
- Computing and Combinatorics
