Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a longest common subsequence between a run-length-encoded string and an uncompressed string |
scientific article |
Statements
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (English)
0 references
28 April 2008
0 references
longest common subsequence
0 references
run-length encoding
0 references
string compression
0 references
0 references
