Computing the longest common subsequence of two run-length encoded strings (Q4909536)
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: Computing the longest common subsequence of two run-length encoded strings |
scientific article; zbMATH DE number 6147805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the longest common subsequence of two run-length encoded strings |
scientific article; zbMATH DE number 6147805 |
Statements
Computing the Longest Common Subsequence of Two Run-Length Encoded Strings (English)
0 references
21 March 2013
0 references
0.9126166105270386
0 references
0.8787025809288025
0 references
0.8312976956367493
0 references
0.8294862508773804
0 references
0.8241329789161682
0 references
