Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:25, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a longest common subsequence that is almost increasing on sequences having no repeated elements |
scientific article |
Statements
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (English)
0 references
13 August 2014
0 references
algorithms
0 references
longest common subsequence
0 references
longest increasing subsequence
0 references
longest almost increasing subsequence
0 references
