Efficient algorithms for finding a longest common increasing subsequence (Q996830): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-006-9031-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078864816 / rank | |||
Normal rank | |||
Revision as of 21:55, 19 March 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
