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

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

Bibliografski detalji
Izdano u:Information processing letters. 61, 3 (1997).
Glavni autor: Lecroq, Thierry
Format: Članak
Jezik:English
Teme:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.