A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings |
scientific article |
Statements
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (English)
0 references
9 June 2010
0 references
design of algorithms
0 references
longest common subsequence
0 references
run-length encoding
0 references
edit distance
0 references
0 references
0 references
