Time-efficient parallel algorithms for the longest common subsequence and related problems (Q1291016)
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: Time-efficient parallel algorithms for the longest common subsequence and related problems |
scientific article; zbMATH DE number 1295370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time-efficient parallel algorithms for the longest common subsequence and related problems |
scientific article; zbMATH DE number 1295370 |
Statements
Time-efficient parallel algorithms for the longest common subsequence and related problems (English)
0 references
3 June 1999
0 references
broadcasting with selective reduction
0 references
