The longest almost-increasing subsequence

DOI10.1016/j.ipl.2010.05.022zbMath1234.68473OpenAlexW1991966478MaRDI QIDQ765507

Amr Elmasry

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.022

zbMATH Keywords

data structuresalgorithm design and analysis

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

Computing longest (common) Lyndon subsequences ⋮ Computing a longest common subsequence that is almost increasing on sequences having no repeated elements ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ Computing a longest common almost-increasing subsequence of two sequences ⋮ Improvised divide and conquer approach for the LIS problem

Uses Software

• MUMMER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the longest increasing subsequence of a circular list
• New clique and independent set algorithms for circle graphs
• On computing the length of longest increasing subsequences
• Longest increasing subsequences in sliding windows
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• Self-adjusting binary search trees
• A fast algorithm for computing longest common subsequences
• On the distribution of the length of the longest increasing subsequence of random permutations
• Tight Ω(nlgn) lower bound for finding a longest increasing subsequence