A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem

zbMATH Open1413.68181MaRDI QIDQ4582900FDOQ4582900

Authors: Sebastian Deorowicz 

Publication date: 24 August 2018

Recommendations

• Longest increasing subsequences in sliding windows
• Faster algorithms for computing longest common increasing subsequences
• On two variants of the longest increasing subsequence problem
• Longest increasing subsequences in windows based on canonical antichain partition
• Algorithms and Computation

zbMATH Keywords

pattern matchinglongest increasing subsequencesliding window

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (5)

• The longest almost increasing subsequence problem with sliding windows
• Longest increasing subsequences in windows based on canonical antichain partition
• On two variants of the longest increasing subsequence problem
• Longest increasing subsequences in sliding windows
• Algorithms and Computation

This page was built for publication: A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4582900)