Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string |
scientific article; zbMATH DE number 5268300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a longest common subsequence between a run-length-encoded string and an uncompressed string |
scientific article; zbMATH DE number 5268300 |
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
0.8831025958061218
0 references
0.8787025809288025
0 references
0.8126910924911499
0 references
0.809624433517456
0 references
0.8018833994865417
0 references
