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 this page instead for the normal view: A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem |
scientific article |
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
