A fast algorithm for computing longest common subsequences (Q4125781): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56004217, #quickstatements; #temporary_batch_1711196317277 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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.1145/359581.359603 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027506564 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56004217 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:21, 23 March 2024
scientific article; zbMATH DE number 3551905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for computing longest common subsequences |
scientific article; zbMATH DE number 3551905 |
Statements
A fast algorithm for computing longest common subsequences (English)
0 references
1977
0 references
