Algorithms for computing variants of the longest common subsequence problem (Q932321)
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: Algorithms for computing variants of the longest common subsequence problem |
scientific article; zbMATH DE number 5299459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for computing variants of the longest common subsequence problem |
scientific article; zbMATH DE number 5299459 |
Statements
Algorithms for computing variants of the longest common subsequence problem (English)
0 references
10 July 2008
0 references
algorithm
0 references
longest common subsequence
0 references
strings
0 references
