A fast algorithm for computing longest common subsequences (Q4125781)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3551905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
