An efficient systolic algorithm for the longest common subsequence problem (Q1275339)
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: An efficient systolic algorithm for the longest common subsequence problem |
scientific article; zbMATH DE number 1241085
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient systolic algorithm for the longest common subsequence problem |
scientific article; zbMATH DE number 1241085 |
Statements
An efficient systolic algorithm for the longest common subsequence problem (English)
0 references
17 January 1999
0 references
VLSI
0 references
longest common subsequence
0 references
0.9760948
0 references
0 references
0.95317686
0 references
0.94072294
0 references
0.9407228
0 references
0.9310033
0 references
0.92612934
0 references
