Bit-parallel algorithm for the constrained longest common subsequence problem (Q4932075)
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: Bit-parallel algorithm for the constrained longest common subsequence problem |
scientific article; zbMATH DE number 5794266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bit-parallel algorithm for the constrained longest common subsequence problem |
scientific article; zbMATH DE number 5794266 |
Statements
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem (English)
0 references
1 October 2010
0 references
constrained longest common subsequence
0 references
longest common subsequence
0 references
dynamic programming
0 references
bit-parallel algorithm
0 references
0.865759015083313
0 references
0.8568201661109924
0 references
0.8519048094749451
0 references
0.842747151851654
0 references
