Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1838657 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Martin Kuetz / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/11780441_30 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1504893030 / rank | |||
Normal rank | |||
Latest revision as of 15:20, 19 March 2024
scientific article; zbMATH DE number 5191222
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Algorithms for Computing Longest Common Increasing Subsequences |
scientific article; zbMATH DE number 5191222 |
Statements
Faster Algorithms for Computing Longest Common Increasing Subsequences (English)
0 references
14 September 2007
0 references
