The longest almost increasing subsequence problem with sliding windows

DOI10.1016/J.TCS.2024.114639MaRDI QIDQ6562878zbMATH OpenFDO

Authors Cheng-Han Ho, Chang-Biau Yang

Publication date 27 June 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

longest increasing subsequencelongest almost increasing subsequencesliding windowprincipal rowrow tower

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem
• A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
• A fast algorithm for computing longest common subsequences
• An algorithm for solving the longest increasing circular subsequence problem
• Computing a longest common almost-increasing subsequence of two sequences
• Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
• Computing the longest common almost-increasing subsequence
• Design and implementation of an efficient priority queue
• Enumerating longest increasing subsequences and patience sorting
• Fast computation of a longest increasing subsequence and application
• Longest Increasing and Decreasing Subsequences
• Longest increasing subsequences in sliding windows
• Longest increasing subsequences in windows based on canonical antichain partition
• On the longest increasing subsequence of a circular list
• The longest almost-increasing subsequence

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)