An algorithm for solving the longest increasing circular subsequence problem

DOI10.1016/J.IPL.2009.02.019zbMath1209.68616OpenAlexW1990084682MaRDI QIDQ987842

Sebastian Deorowicz

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

zbMATH Keywords

algorithmsstring matchinglongest increasing subsequencelongest increasing circular subsequence

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

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

This page was built for publication: An algorithm for solving the longest increasing circular subsequence problem