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

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

Bibliografiska uppgifter
I publikationen:Information processing letters. 61, 3 (1997).
Huvudupphovsman: Lecroq, Thierry
Materialtyp: Artikel
Språk:English
Ämnen:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.