The longest almost-increasing subsequence
From MaRDI portal
Publication:765507
DOI10.1016/J.IPL.2010.05.022zbMATH Open1234.68473OpenAlexW1991966478MaRDI QIDQ765507FDOQ765507
Authors: 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
Recommendations
- The Longest Almost-Increasing Subsequence
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- An algorithm for the determination of longest increasing subsequence in a sequence
- Computing a longest common almost-increasing subsequence of two sequences
- Fast computation of a longest increasing subsequence and application
Cites Work
- Introduction to algorithms
- Permutations, matrices, and generalized Young tableaux
- Longest Increasing and Decreasing Subsequences
- On the distribution of the length of the longest increasing subsequence of random permutations
- Self-adjusting binary search trees
- On computing the length of longest increasing subsequences
- Longest increasing subsequences in sliding windows
- A fast algorithm for computing longest common subsequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- New clique and independent set algorithms for circle graphs
- Tight Ω(nlgn) lower bound for finding a longest increasing subsequence
- Title not available (Why is that?)
- On the longest increasing subsequence of a circular list
Cited In (14)
- Small Longest Tandem Scattered Subsequences
- On longest matching consecutive subsequence
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- The longest almost increasing subsequence problem with sliding windows
- The Longest Almost-Increasing Subsequence
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
- Improvised divide and conquer approach for the LIS problem
- Book review of: D. Romik, The surprising mathematics of longest increasing subsequences
- Computing a longest common almost-increasing subsequence of two sequences
- Longest increasing subsequences and log concavity
- Computing longest (common) Lyndon subsequences
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
- On the longest increasing subsequence for finite and countable alphabets
- Title not available (Why is that?)
Uses Software
This page was built for publication: The longest almost-increasing subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765507)
