Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism |
scientific article |
Statements
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (English)
0 references
21 July 2009
0 references
longest common subsequence
0 references
run-length encoding
0 references
string comparison
0 references
parallel processing
0 references
