Sparse Dynamic Programming for Longest Common Subsequence from Fragments (Q4538080)
From MaRDI portal
scientific article; zbMATH DE number 1766676
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparse Dynamic Programming for Longest Common Subsequence from Fragments |
scientific article; zbMATH DE number 1766676 |
Statements
Sparse Dynamic Programming for Longest Common Subsequence from Fragments (English)
0 references
11 July 2002
0 references
sparse dynamic programming
0 references
