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

DOI10.1016/j.jda.2012.12.005zbMath1334.68320OpenAlexW1999879627MaRDI QIDQ396635

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

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.12.005

zbMATH Keywords

algorithmslongest common subsequencelongest increasing subsequencelongest almost increasing subsequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (3)

Computing the longest common almost-increasing subsequence ⋮ Computing a longest common almost-increasing subsequence of two sequences ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Enumerating longest increasing subsequences and patience sorting
• A new efficient algorithm for computing the longest common subsequence
• The longest almost-increasing subsequence
• A fast algorithm for computing a longest common increasing subsequence
• A linear space algorithm for computing a longest common increasing subsequence
• A faster algorithm computing string edit distances
• Fast computation of a longest increasing subsequence and application
• Longest Increasing and Decreasing Subsequences
• A fast algorithm for computing longest common subsequences
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• Faster Algorithms for Computing Longest Common Increasing Subsequences
• Algorithms and Computation

This page was built for publication: Computing a longest common subsequence that is almost increasing on sequences having no repeated elements