Algorithms for Computing Variants of the Longest Common Subsequence Problem (Q5459135)
From MaRDI portal
scientific article; zbMATH DE number 5267606
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Computing Variants of the Longest Common Subsequence Problem |
scientific article; zbMATH DE number 5267606 |
Statements
Algorithms for Computing Variants of the Longest Common Subsequence Problem (English)
0 references
24 April 2008
0 references
