A fast algorithm for computing longest common subsequences (Q4125781): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:39, 6 February 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
