Efficient algorithms for finding a longest common increasing subsequence (Q996830): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MUMMER / rank | |||
Normal rank | |||
Revision as of 14:59, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding a longest common increasing subsequence |
scientific article |
Statements
Efficient algorithms for finding a longest common increasing subsequence (English)
0 references
19 July 2007
0 references
Design and analysis of algorithms
0 references
Longest common increasing subsequence
0 references
