An algorithm for solving the longest increasing circular subsequence problem
From MaRDI portal
Publication:987842
DOI10.1016/j.ipl.2009.02.019zbMath1209.68616MaRDI QIDQ987842
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.019
algorithms; string matching; longest increasing subsequence; longest increasing circular subsequence
68W05: Nonnumerical algorithms
Related Items
Online Scheduling with Increasing Subsequence Serving Constraint, On-line Scheduling with a Monotonous Subsequence Constraint, Improvised divide and conquer approach for the LIS problem, On-line scheduling with monotone subsequence constraints
Cites Work
- On the longest increasing subsequence of a circular list
- Semi-local string comparison: algorithmic techniques and applications
- Longest increasing subsequences in sliding windows
- Longest increasing subsequences in windows based on canonical antichain partition
- Design and implementation of an efficient priority queue