Bit-parallel algorithms for the merged longest common subsequence problem (Q5168418)
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 6313575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bit-parallel algorithms for the merged longest common subsequence problem |
scientific article; zbMATH DE number 6313575 |
Statements
BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (English)
0 references
4 July 2014
0 references
sequence comparison
0 references
merged longest common subsequence
0 references
bit-parallelism
0 references
0.8683432340621948
0 references
0.8253793120384216
0 references
0.8162643909454346
0 references
0.7982503175735474
0 references
