A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (Q2502283)
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 5053104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem |
scientific article; zbMATH DE number 5053104 |
Statements
A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (English)
0 references
12 September 2006
0 references
Coarse-Grained Multicomputer
0 references
0.93298954
0 references
0.91542846
0 references
0.9099443
0 references
0.90981925
0 references
0.9020386
0 references
0 references
