Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5581123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism |
scientific article; zbMATH DE number 5581123 |
Statements
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (English)
0 references
21 July 2009
0 references
longest common subsequence
0 references
run-length encoding
0 references
string comparison
0 references
parallel processing
0 references
0.8713417649269104
0 references
0.8294862508773804
0 references
0.8287938833236694
0 references
0.8275304436683655
0 references
0.8216750025749207
0 references
