An algorithm for solving the longest increasing circular subsequence problem

Authors:
Sebastian Deorowicz
Affiliations:
Silesian University of Technology, Institute of Computer Science, 44-100 Gliwice, Akademicka 16, Poland
Venue:
Information Processing Letters
Year:
2009

Citing 5
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Longest increasing subsequences in sliding windows

Theoretical Computer Science
A comparative genome approach to marker ordering

Bioinformatics
On the longest increasing subsequence of a circular list

Information Processing Letters
Longest increasing subsequences in windows based on canonical antichain partition

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract