A faster linear systolic algorithm for recovering a longest common subsequence.

A faster linear systolic algorithm for recovering a longest common subsequence.

Xehetasun bibliografikoak
Argitaratua izan da:Information processing letters. 61, 3 (1997).
Egile nagusia: Lecroq, Thierry
Formatua: Artikulua
Hizkuntza:English
Gaiak:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.