Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842)
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 6049375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for computing the constrained LCS of run-length encoded strings |
scientific article; zbMATH DE number 6049375 |
Statements
Fast algorithms for computing the constrained LCS of run-length encoded strings (English)
0 references
25 June 2012
0 references
design of algorithms
0 references
longest common subsequence
0 references
run-length encoding
0 references
constrained LCS
0 references
0 references
0 references
0 references
0 references
0.8887391090393066
0 references
0.8814888596534729
0 references
0.867577314376831
0 references
0.8324247598648071
0 references
