A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491)
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: A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings |
scientific article; zbMATH DE number 5719214
| 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; zbMATH DE number 5719214 |
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
0.9621941
0 references
0.9549363
0 references
0.92905855
0 references
0.92421526
0 references
0.9218162
0 references
0.9218162
0 references
0.9168877
0 references
0.9143116
0 references
