A fast algorithm for the longest-common-subsequence problem (Q1155365)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm for the longest-common-subsequence problem |
scientific article; zbMATH DE number 3731358
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the longest-common-subsequence problem |
scientific article; zbMATH DE number 3731358 |
Statements
A fast algorithm for the longest-common-subsequence problem (English)
0 references
1980
0 references