The longest wave subsequence problem: generalizations of the longest increasing subsequence problem
From MaRDI portal
Cites work
- A diagonal-based algorithm for the longest common increasing subsequence problem
- A distributed hierarchical genetic algorithm for efficient optimization and pattern matching
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- A fast algorithm for computing a longest common increasing subsequence
- A fast algorithm for computing longest common subsequences
- A fast algorithm for order-preserving pattern matching
- A filtration method for order-preserving matching
- A linear time algorithm for consecutive permutation pattern matching
- Design and implementation of an efficient priority queue
- Enumerating longest increasing subsequences and patience sorting
- Fast computation of a longest increasing subsequence and application
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 42967 (Why is no real title available?)
- Longest Increasing and Decreasing Subsequences
- Longest increasing subsequences in sliding windows
- On computing the length of longest increasing subsequences
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- Order-preserving matching
- Order-preserving pattern matching with \(k\) mismatches
- The longest almost-increasing subsequence
This page was built for publication: The longest wave subsequence problem: generalizations of the longest increasing subsequence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013990)
