An algorithm for matching run-length coded strings (Q685867)
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: An algorithm for matching run-length coded strings |
scientific article; zbMATH DE number 425526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for matching run-length coded strings |
scientific article; zbMATH DE number 425526 |
Statements
An algorithm for matching run-length coded strings (English)
0 references
20 December 1993
0 references
string matching
0 references
longest common subsequence
0 references
run-length coded strings
0 references
time complexity
0 references
0.8683634400367737
0 references
0.8576423525810242
0 references
0.8439780473709106
0 references
0.8389434218406677
0 references
0.8335985541343689
0 references
