A faster linear systolic algorithm for recovering a longest common subsequence (Q290200)
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 faster linear systolic algorithm for recovering a longest common subsequence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster linear systolic algorithm for recovering a longest common subsequence |
scientific article |
Statements
A faster linear systolic algorithm for recovering a longest common subsequence (English)
0 references
1 June 2016
0 references
parallel algorithms
0 references
parallel architectures
0 references
linear systolic arrays
0 references
VLSI
0 references
longest common subsequence problem
0 references
