A space efficient algorithm for the longest common subsequence in \(k\)-length substrings (Q2357383)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A space efficient algorithm for the longest common subsequence in \(k\)-length substrings |
scientific article |
Statements
A space efficient algorithm for the longest common subsequence in \(k\)-length substrings (English)
0 references
13 June 2017
0 references
longest common subsequence
0 references
similarity of strings
0 references
edit distance
0 references
dynamic programming
0 references
