a public good project by the
Synthesis
Company
of California

© 2026

Computing a longest common subsequence that is almost increasing on sequences having no repeated elements | doi.page

0 citations0 references

Google Scholar doi.org

Computing a longest common subsequence that is almost increasing on sequences having no repeated elements

Journal of Discrete Algorithms·2012·Vol. 20, pp. 12–20

Citations Over Time

Johra Muhammad Moosa, M. Sohel Rahman, Fatema Tuz Zohora

Related Papers

→ On Two Variants of the Longest Increasing Subsequence Problem(2009)7 cited
→ The Longest Subsequence-Repeated Subsequence Problem(2023)4 cited
→ Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem(2010)3 cited
→ The Constrained Longest Common Subsequence Problem for Degenerate Strings(2007)4 cited
→ Longest (Sub-)Periodic Subsequence(2022)1 cited