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; zbMATH DE number 6588284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster linear systolic algorithm for recovering a longest common subsequence |
scientific article; zbMATH DE number 6588284 |
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
0.952963888645172
0 references
0.9308205246925354
0 references
0.896023154258728
0 references
0.8951417207717896
0 references
