An algorithm for solving the longest increasing circular subsequence problem (Q987842): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990084682 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the longest increasing subsequence of a circular list / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Longest increasing subsequences in sliding windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Longest increasing subsequences in windows based on canonical antichain partition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Design and implementation of an efficient priority queue / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semi-local string comparison: algorithmic techniques and applications / rank | |||
Normal rank | |||
Latest revision as of 02:53, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for solving the longest increasing circular subsequence problem |
scientific article |
Statements
An algorithm for solving the longest increasing circular subsequence problem (English)
0 references
16 August 2010
0 references
algorithms
0 references
longest increasing subsequence
0 references
longest increasing circular subsequence
0 references
string matching
0 references
