The longest almost increasing subsequence problem with sliding windows
From MaRDI portal
Publication:6562878
DOI10.1016/J.TCS.2024.114639MaRDI QIDQ6562878FDOQ6562878
Authors: Cheng-Han Ho, Chang-Biau Yang 
Publication date: 27 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
longest increasing subsequencelongest almost increasing subsequencesliding windowprincipal rowrow tower
Cites Work
- Longest Increasing and Decreasing Subsequences
- Longest increasing subsequences in sliding windows
- Fast computation of a longest increasing subsequence and application
- Enumerating longest increasing subsequences and patience sorting
- A fast algorithm for computing longest common subsequences
- Design and implementation of an efficient priority queue
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- The longest almost-increasing subsequence
- On the longest increasing subsequence of a circular list
- Longest increasing subsequences in windows based on canonical antichain partition
- An algorithm for solving the longest increasing circular subsequence problem
- Computing the longest common almost-increasing subsequence
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- Computing a longest common almost-increasing subsequence of two sequences
- A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem
This page was built for publication: The longest almost increasing subsequence problem with sliding windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562878)
